solves can place flowers

Author: anishLearnsToCode

Diff for: README.md

@@ -159,7 +159,7 @@
 | 598 | [Range Addition II](https://leetcode.com/problems/range-addition-ii) | [![Java](assets/java.png)](src/RangeAdditionII.java) [![Python](assets/python.png)](python/range_addition_ii.py) |
 | 599 | [Minimum Index Sum of 2 Lists](https://leetcode.com/problems/minimum-index-sum-of-two-lists) | [![Java](assets/java.png)](src/MinimumIndexSumOfTwoLists.java) [![Python](assets/python.png)](python/minimum_index_sum_of_two_lists.py) |
 | 604 | 🔒 [Design Compressed String Iterator](https://leetcode.com/problems/design-compressed-string-iterator) | |
-| 605 | [Can Place Flowers](https://leetcode.com/problems/can-place-flowers) | |
+| 605 | [Can Place Flowers](https://leetcode.com/problems/can-place-flowers) | [![Java](assets/java.png)](src/CanPlaceFlowers.java) [![Python](assets/python.png)](python/can_place_flowers.py) |
 | 606 | [Construct String from Binary Tree](https://leetcode.com/problems/construct-string-from-binary-tree) | |
 | 617 | [Merge Two Binary Trees](https://leetcode.com/problems/merge-two-binary-trees) | |
 | 624 | [Maximum Distance in Arrays](https://leetcode.com/problems/maximum-distance-in-arrays) | |

Diff for: python/can_place_flowers.py

@@ -0,0 +1,14 @@
+from typing import List
+
+
+class Solution:
+    def flowerBedCapacity(self, flowerbed: List[int]) -> int:
+        capacity = 0
+        for index, value in enumerate(flowerbed):
+            if value != 1 and (index == 0 or flowerbed[index - 1] == 0) and (index == len(flowerbed) - 1 or flowerbed[index + 1] == 0):
+                capacity += 1
+                flowerbed[index] = 1
+        return capacity
+
+    def canPlaceFlowers(self, flowerbed: List[int], n: int) -> bool:
+        return self.flowerBedCapacity(flowerbed) >= n

Diff for: src/CanPlaceFlowers.java

@@ -0,0 +1,16 @@
+public class CanPlaceFlowers {
+    public boolean canPlaceFlowers(int[] flowerbed, int n) {
+        return flowersCapacity(flowerbed) >= n;
+    }
+
+    private int flowersCapacity(int[] flowerbed) {
+        int capacity = 0;
+        for (int index = 0 ; index < flowerbed.length ; index++) {
+            if ((flowerbed[index] != 1) && (index == 0 || flowerbed[index - 1] == 0) && (index == flowerbed.length - 1 || flowerbed[index + 1] == 0)) {
+                capacity++;
+                flowerbed[index] = 1;
+            }
+        }
+        return capacity;
+    }
+}