refactor 476

Author: fishercoder1534

src/main/java/com/fishercoder/solutions/_476.java

@@ -1,6 +1,8 @@
 package com.fishercoder.solutions;
 
 /**
+ * 476. Number Complement
+ *
  * Given a positive integer, output its complement number. The complement strategy is to flip the bits of its binary representation.
 
  Note:
@@ -17,21 +19,25 @@
  */
 public class _476 {
 
-    public int findComplement_oneLiner(int num) {
-        return ~num & ((Integer.highestOneBit(num) << 1) - 1);
+    public static class Solution1 {
+        public int findComplement(int num) {
+            return ~num & ((Integer.highestOneBit(num) << 1) - 1);
+        }
     }
 
-    public int findComplement(int num) {
-        String str = Integer.toBinaryString(num);
-        StringBuilder sb = new StringBuilder();
-        char[] chars = str.toCharArray();
-        for (int i = 0; i < chars.length; i++) {
-            if (chars[i] == '0') {
-                sb.append("1");
-            } else {
-                sb.append("0");
+    public static class Solution2 {
+        public int findComplement(int num) {
+            String str = Integer.toBinaryString(num);
+            StringBuilder sb = new StringBuilder();
+            char[] chars = str.toCharArray();
+            for (int i = 0; i < chars.length; i++) {
+                if (chars[i] == '0') {
+                    sb.append("1");
+                } else {
+                    sb.append("0");
+                }
             }
+            return Integer.parseInt(sb.toString(), 2);
         }
-        return Integer.parseInt(sb.toString(), 2);
     }
 }

src/test/java/com/fishercoder/_476Test.java

@@ -11,14 +11,16 @@
  * Created by fishercoder on 1/14/17.
  */
 public class _476Test {
-    private static _476 test;
+    private static _476.Solution1 solution1;
+    private static _476.Solution2 solution2;
     private static int expected;
     private static int actual;
     private static int input;
 
     @BeforeClass
     public static void setup() {
-        test = new _476();
+        solution1 = new _476.Solution1();
+        solution2 = new _476.Solution2();
     }
 
     @Before
@@ -33,7 +35,8 @@ public void test1() {
 
         input = 5;
         expected = 2;
-        actual = test.findComplement(input);
+        actual = solution1.findComplement(input);
+        actual = solution2.findComplement(input);
         assertEquals(expected, actual);
 
     }
@@ -43,7 +46,8 @@ public void test2() {
 
         input = 5;
         expected = 2;
-        actual = test.findComplement_oneLiner(input);
+        actual = solution1.findComplement(input);
+        actual = solution2.findComplement(input);
         assertEquals(expected, actual);
 
     }