optimize 605

Author: fishercoder1534

src/main/java/com/fishercoder/solutions/firstthousand/_605.java

@@ -27,62 +27,14 @@ public boolean canPlaceFlowers(int[] flowerbed, int n) {
 
     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;
-            }
-            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--;
-                    // modify the input, discuss this with interviwer, if not allowed, then have a
-                    // copy of this input and modify copy
-                    flowerbed[i] = 1;
-                }
-                if (n <= 0) {
-                    return true;
-                }
-            }
-            if (len >= 2 && flowerbed[len - 2] == 0 && flowerbed[len - 1] == 0) {
-                n--;
-            }
-            if (n <= 0) {
-                return true;
-            }
-            return false;
-        }
-    }
-
-    public static class Solution3 {
-        public boolean canPlaceFlowers(int[] flowerbed, int n) {
-            if (flowerbed.length == 1) {
-                if (flowerbed[0] == 0) {
-                    return n <= 1;
-                } else {
-                    return n <= 0;
-                }
-            }
             for (int i = 0; i < flowerbed.length; i++) {
-                if (i == 0) {
-                    if (flowerbed[i] == 0 && (i + 1) < flowerbed.length && flowerbed[i + 1] == 0) {
-                        n--;
-                        flowerbed[i] = 1;
-                    }
-                } else if (i < flowerbed.length - 1) {
-                    if (flowerbed[i - 1] == 0 && flowerbed[i + 1] == 0 && flowerbed[i] == 0) {
-                        n--;
-                        flowerbed[i] = 1;
-                    }
-                } else if (flowerbed[i] == 0) {
-                    if (flowerbed[i - 1] == 0) {
-                        n--;
-                        flowerbed[i] = 1;
+                boolean emptyLeftPlot = i == 0 || flowerbed[i - 1] == 0;
+                boolean emptyRightPlot = i == flowerbed.length - 1 || flowerbed[i + 1] == 0;
+                if (emptyLeftPlot && emptyRightPlot && flowerbed[i] == 0) {
+                    flowerbed[i] = 1;
+                    n--;
+                    if (n <= 0) {
+                        return true;
                     }
                 }
             }

src/test/java/com/fishercoder/firstthousand/_605Test.java

@@ -9,15 +9,13 @@
 public class _605Test {
     private _605.Solution1 solution1;
     private _605.Solution2 solution2;
-    private _605.Solution3 solution3;
     private static int[] flowerbed;
     private static int n;
 
     @BeforeEach
     public void setup() {
         solution1 = new _605.Solution1();
         solution2 = new _605.Solution2();
-        solution3 = new _605.Solution3();
     }
 
     @Test
@@ -159,11 +157,4 @@ public void test20() {
         n = 1;
         assertEquals(true, solution2.canPlaceFlowers(flowerbed, n));
     }
-
-    @Test
-    public void test21() {
-        flowerbed = new int[] {0};
-        n = 1;
-        assertTrue(solution3.canPlaceFlowers(flowerbed, n));
-    }
 }