Added S605 solution for leetcode

Author: MewX

LeetCode/LeetCode.iml

@@ -0,0 +1,27 @@
+package problem.algorithm;
+
+public class S605 {
+    public boolean canPlaceFlowers(int[] flowerbed, int n) {
+        int max = 0;
+
+        int i = 0;
+        while (i < flowerbed.length && flowerbed[i] == 0) i ++;
+        // make i = 1
+        max += i/ 2;
+        if (i == flowerbed.length) max = (flowerbed.length + 1) / 2;
+
+        while (i < flowerbed.length) {
+            // from having flower
+            while (i < flowerbed.length && flowerbed[i] == 1) i++;
+            // make i = 0
+            int beg1 = i;
+
+            while (i < flowerbed.length && flowerbed[i] == 0) i++;
+            // make i = 1
+            if (i == flowerbed.length) i ++;
+            max += (i - beg1 - 1) / 2;
+        }
+
+        return max >= n;
+    }
+}

LeetCode/src/problem/algorithm/S605.java

@@ -0,0 +1,56 @@
+package problem.algorithm;
+
+import org.testng.Assert;
+import org.testng.annotations.Test;
+
+public class S605Test {
+
+    @Test
+    public void testExample1() {
+        Assert.assertEquals(new S605().canPlaceFlowers(new int[]{1, 0, 0, 0, 1}, 1), true);
+    }
+
+    @Test
+    public void testExample2() {
+        Assert.assertEquals(new S605().canPlaceFlowers(new int[]{1, 0, 0, 0, 1}, 2), false);
+    }
+
+    @Test
+    public void testCustom1() {
+        Assert.assertEquals(new S605().canPlaceFlowers(new int[]{1, 0, 0, 1, 0, 0}, 1), true);
+        Assert.assertEquals(new S605().canPlaceFlowers(new int[]{1, 0, 0, 1, 0, 0}, 2), false);
+    }
+
+    @Test
+    public void testCustom2() {
+        Assert.assertEquals(new S605().canPlaceFlowers(new int[]{0, 0, 1, 0, 0, 1, 1}, 1), true);
+        Assert.assertEquals(new S605().canPlaceFlowers(new int[]{0, 0, 1, 0, 0, 1, 1}, 2), false);
+    }
+
+    @Test
+    public void testCustom3() {
+        Assert.assertEquals(new S605().canPlaceFlowers(new int[]{0, 1, 0, 0, 1, 1}, 0), true);
+        Assert.assertEquals(new S605().canPlaceFlowers(new int[]{0, 1, 0, 0, 1, 1}, 1), false);
+    }
+
+    @Test
+    public void testRegression1() {
+        Assert.assertEquals(new S605().canPlaceFlowers(new int[]{0}, 1), true);
+        Assert.assertEquals(new S605().canPlaceFlowers(new int[]{1}, 1), false);
+    }
+
+    @Test
+    public void testRegression2() {
+        Assert.assertEquals(new S605().canPlaceFlowers(new int[]{0, 0}, 1), true);
+        Assert.assertEquals(new S605().canPlaceFlowers(new int[]{0, 0}, 2), false);
+        Assert.assertEquals(new S605().canPlaceFlowers(new int[]{1, 0}, 1), false);
+        Assert.assertEquals(new S605().canPlaceFlowers(new int[]{0, 1}, 1), false);
+    }
+
+
+    @Test
+    public void testRegression3() {
+        Assert.assertEquals(new S605().canPlaceFlowers(new int[]{0, 0, 0}, 2), true);
+        Assert.assertEquals(new S605().canPlaceFlowers(new int[]{0, 0, 0}, 3), false);
+    }
+}