refactor 600

Author: fishercoder1534

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

@@ -22,7 +22,7 @@
  */
 public class _600 {
 
-    public static class DPSolution {
+    public static class Solution1 {
         /**
          * Credit: https://leetcode.com/articles/non-negative-integers-without-consecutive-ones/#approach-3-using-bit-manipulation-accepted
          */
@@ -53,27 +53,4 @@ public int findIntegers(int num) {
         }
     }
 
-    /**
-     * Brute force is definitely correct, but too time consuming and resulted in TLE.
-     */
-    public int findIntegers(int num) {
-        int answer = 0;
-        for (int i = 0; i <= num; i++) {
-            if (hasConsecutiveOnes(i)) {
-                answer++;
-            }
-        }
-        return answer;
-    }
-
-    private boolean hasConsecutiveOnes(int num) {
-        String bin = Integer.toBinaryString(num);
-        for (int i = 0; i < bin.length() - 1; i++) {
-            if (bin.charAt(i) == '1' && bin.charAt(i + 1) == '1') {
-                return false;
-            }
-        }
-        return true;
-    }
-
 }

src/test/java/com/fishercoder/_600Test.java

@@ -10,21 +10,16 @@
  * Created by fishercoder on 5/28/17.
  */
 public class _600Test {
-    private static _600 test;
-    private static _600.DPSolution dpSolution;
+    private static _600.Solution1 solution1;
 
     @BeforeClass
     public static void setup() {
-        test = new _600();
-        dpSolution = new _600.DPSolution();
+        solution1 = new _600.Solution1();
     }
 
     @Test
     public void test1() {
-        assertEquals(5, dpSolution.findIntegers(5));
-        assertEquals(514229, dpSolution.findIntegers(100000000));
-
-        assertEquals(5, test.findIntegers(5));
-        assertEquals(514229, test.findIntegers(100000000));//this takes too long when using brute force
+        assertEquals(5, solution1.findIntegers(5));
+        assertEquals(514229, solution1.findIntegers(100000000));
     }
 }