refactor 605

fishercoder1534 · fishercoder1534 · commit 6719bd92da5c · 2019-07-29T07:40:46.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_605.java b/src/main/java/com/fishercoder/solutions/_605.java
@@ -25,53 +25,57 @@ Given a flowerbed (represented as an array containing 0 and 1, where 0 means emp
  */
 public class _605 {
 
-    public boolean canPlaceFlowers_more_concise_version(int[] flowerbed, int n) {
-        int count = 0;
-        int i = 0;
-        while (i < flowerbed.length) {
-            if (flowerbed[i] == 0 && (i == 0 || flowerbed[i - 1] == 0) && (i == flowerbed.length - 1 || flowerbed[i + 1] == 0)) {
-                count++;
-                flowerbed[i] = 1;
+    public static class Solution1 {
+        public boolean canPlaceFlowers(int[] flowerbed, int n) {
+            int count = 0;
+            int i = 0;
+            while (i < flowerbed.length) {
+                if (flowerbed[i] == 0 && (i == 0 || flowerbed[i - 1] == 0) && (i == flowerbed.length - 1 || flowerbed[i + 1] == 0)) {
+                    count++;
+                    flowerbed[i] = 1;
+                }
+                if (count >= n) {
+                    return true;
+                }
+                i++;
             }
             if (count >= n) {
                 return true;
             }
-            i++;
-        }
-        if (count >= n) {
-            return true;
+            return false;
         }
-        return false;
     }
 
-    public boolean canPlaceFlowers(int[] flowerbed, int n) {
-        int len = flowerbed.length;
-        if (len == 1) {
-            if ((flowerbed[0] == 0 && n <= 1) || n == 0) {
-                return true;
+    public static class Solution2 {
+        public boolean canPlaceFlowers(int[] flowerbed, int n) {
+            int len = flowerbed.length;
+            if (len == 1) {
+                if ((flowerbed[0] == 0 && n <= 1) || n == 0) {
+                    return true;
+                }
+                return false;
             }
-            return false;
-        }
-        if (flowerbed[0] == 0 && flowerbed[1] == 0) {
-            flowerbed[0] = 1;
-            n--;
-        }
-        for (int i = 1; i < len - 1; i++) {
-            if (flowerbed[i] == 0 && flowerbed[i - 1] == 0 && flowerbed[i + 1] == 0) {
+            if (flowerbed[0] == 0 && flowerbed[1] == 0) {
+                flowerbed[0] = 1;
+                n--;
+            }
+            for (int i = 1; i < len - 1; i++) {
+                if (flowerbed[i] == 0 && flowerbed[i - 1] == 0 && flowerbed[i + 1] == 0) {
+                    n--;
+                    flowerbed[i] = 1;//modify the input, discuss this with interviwer, if not allowed, then have a copy of this input and modify copy
+                }
+                if (n <= 0) {
+                    return true;
+                }
+            }
+            if (len >= 2 && flowerbed[len - 2] == 0 && flowerbed[len - 1] == 0) {
                 n--;
-                flowerbed[i] = 1;//modify the input, discuss this with interviwer, if not allowed, then have a copy of this input and modify copy
             }
             if (n <= 0) {
                 return true;
             }
+            return false;
         }
-        if (len >= 2 && flowerbed[len - 2] == 0 && flowerbed[len - 1] == 0) {
-            n--;
-        }
-        if (n <= 0) {
-            return true;
-        }
-        return false;
     }
 
 }
diff --git a/src/test/java/com/fishercoder/_605Test.java b/src/test/java/com/fishercoder/_605Test.java
@@ -7,82 +7,154 @@
 import static org.junit.Assert.assertEquals;
 
 public class _605Test {
-    private static _605 test;
+    private static _605.Solution1 solution1;
+    private static _605.Solution2 solution2;
     private static int[] flowerbed;
     private static int n;
 
     @BeforeClass
     public static void setup() {
-        test = new _605();
+        solution1 = new _605.Solution1();
+        solution2 = new _605.Solution2();
     }
 
     @Test
     public void test1() {
         flowerbed = new int[]{1, 0, 0, 0, 1};
         n = 1;
-        assertEquals(true, test.canPlaceFlowers(flowerbed, n));
+        assertEquals(true, solution1.canPlaceFlowers(flowerbed, n));
     }
 
     @Test
     public void test2() {
         flowerbed = new int[]{1, 0, 0, 0, 1};
         n = 2;
-        assertEquals(false, test.canPlaceFlowers(flowerbed, n));
+        assertEquals(false, solution1.canPlaceFlowers(flowerbed, n));
     }
 
     @Test
     public void test3() {
         flowerbed = new int[]{1, 0, 0, 0, 0, 1};
         n = 2;
-        assertEquals(false, test.canPlaceFlowers(flowerbed, n));
+        assertEquals(false, solution1.canPlaceFlowers(flowerbed, n));
     }
 
     @Test
     public void test4() {
         flowerbed = new int[]{1, 0, 1, 0, 1, 0, 1};
         n = 1;
-        assertEquals(false, test.canPlaceFlowers(flowerbed, n));
+        assertEquals(false, solution1.canPlaceFlowers(flowerbed, n));
     }
 
     @Test
     public void test5() {
         flowerbed = new int[]{0, 0, 1, 0, 1};
         n = 1;
-        assertEquals(true, test.canPlaceFlowers(flowerbed, n));
+        assertEquals(true, solution1.canPlaceFlowers(flowerbed, n));
     }
 
     @Test
     public void test6() {
         flowerbed = new int[]{1, 0, 0, 0, 1, 0, 0};
         n = 2;
-        assertEquals(true, test.canPlaceFlowers(flowerbed, n));
+        assertEquals(true, solution1.canPlaceFlowers(flowerbed, n));
     }
 
     @Test
     public void test7() {
         flowerbed = new int[]{0, 0, 1, 0, 0};
         n = 2;
-        assertEquals(true, test.canPlaceFlowers(flowerbed, n));
+        assertEquals(true, solution1.canPlaceFlowers(flowerbed, n));
     }
 
     @Test
     public void test8() {
         flowerbed = new int[]{1};
         n = 0;
-        assertEquals(true, test.canPlaceFlowers(flowerbed, n));
+        assertEquals(true, solution1.canPlaceFlowers(flowerbed, n));
     }
 
     @Test
     public void test9() {
         flowerbed = new int[]{0};
         n = 0;
-        assertEquals(true, test.canPlaceFlowers(flowerbed, n));
+        assertEquals(true, solution1.canPlaceFlowers(flowerbed, n));
     }
 
     @Test
     public void test10() {
         flowerbed = new int[]{0};
         n = 1;
-        assertEquals(true, test.canPlaceFlowers(flowerbed, n));
+        assertEquals(true, solution1.canPlaceFlowers(flowerbed, n));
+    }
+
+    @Test
+    public void test11() {
+        flowerbed = new int[]{1, 0, 0, 0, 1};
+        n = 1;
+        assertEquals(true, solution2.canPlaceFlowers(flowerbed, n));
+    }
+
+    @Test
+    public void test12() {
+        flowerbed = new int[]{1, 0, 0, 0, 1};
+        n = 2;
+        assertEquals(false, solution2.canPlaceFlowers(flowerbed, n));
+    }
+
+    @Test
+    public void test13() {
+        flowerbed = new int[]{1, 0, 0, 0, 0, 1};
+        n = 2;
+        assertEquals(false, solution2.canPlaceFlowers(flowerbed, n));
+    }
+
+    @Test
+    public void test14() {
+        flowerbed = new int[]{1, 0, 1, 0, 1, 0, 1};
+        n = 1;
+        assertEquals(false, solution2.canPlaceFlowers(flowerbed, n));
+    }
+
+    @Test
+    public void test15() {
+        flowerbed = new int[]{0, 0, 1, 0, 1};
+        n = 1;
+        assertEquals(true, solution2.canPlaceFlowers(flowerbed, n));
+    }
+
+    @Test
+    public void test16() {
+        flowerbed = new int[]{1, 0, 0, 0, 1, 0, 0};
+        n = 2;
+        assertEquals(true, solution2.canPlaceFlowers(flowerbed, n));
+    }
+
+    @Test
+    public void test17() {
+        flowerbed = new int[]{0, 0, 1, 0, 0};
+        n = 2;
+        assertEquals(true, solution2.canPlaceFlowers(flowerbed, n));
+    }
+
+    @Test
+    public void test18() {
+        flowerbed = new int[]{1};
+        n = 0;
+        assertEquals(true, solution2.canPlaceFlowers(flowerbed, n));
+    }
+
+    @Test
+    public void test19() {
+        flowerbed = new int[]{0};
+        n = 0;
+        assertEquals(true, solution2.canPlaceFlowers(flowerbed, n));
+    }
+
+    @Test
+    public void test20() {
+        flowerbed = new int[]{0};
+        n = 1;
+        assertEquals(true, solution2.canPlaceFlowers(flowerbed, n));
     }
 }
