refactor 605

fishercoder1534 · fishercoder1534 · commit 4884f700e837 · 2020-12-05T06:07:27.000-08:00
diff --git a/src/main/java/com/fishercoder/solutions/_605.java b/src/main/java/com/fishercoder/solutions/_605.java
@@ -39,7 +39,8 @@ public boolean canPlaceFlowers(int[] flowerbed, int 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
+                    //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;
