[Array] Add a solution to Can Place Flowers

Author: soapyigu

Array/CanPlaceFlowers.swift

@@ -0,0 +1,42 @@
+/**
+ * Question Link: https://leetcode.com/problems/can-place-flowers/
+ * Primary idea: Greedy algorithm. Place flowers as early as possible.
+ * Time Complexity: O(n), Space Complexity: O(1)
+ *
+ */
+
+class CanPlaceFlowers {
+    func canPlaceFlowers(_ flowerbed: [Int], _ n: Int) -> Bool {
+        var maxFlowersCouldPlant = 0, flowerbed = flowerbed
+        
+        for i in 0..<flowerbed.count {
+            guard flowerbed[i] == 0 else {
+                continue
+            }
+            
+            if i < 1 {
+                if flowerbed.count == 1 || flowerbed[i + 1] != 1 {
+                    flowerbed[i] = 1
+                    maxFlowersCouldPlant += 1
+                }
+            } else if i + 1 == flowerbed.count {
+                if flowerbed.count == 1 || flowerbed[i - 1] != 1 {
+                    flowerbed[i] = 1
+                    maxFlowersCouldPlant += 1
+                }
+            } else {
+                if flowerbed[i - 1] != 1 && flowerbed[i + 1] != 1 {
+                    flowerbed[i] = 1
+                    maxFlowersCouldPlant += 1
+                }
+            }
+            
+            // early exit
+            if maxFlowersCouldPlant >= n {
+                return true
+            }
+        }
+        
+        return maxFlowersCouldPlant >= n
+    }
+}

README.md

@@ -4,7 +4,7 @@
 ![Leetcode](./logo.png?style=centerme)
 
 ## Progress
-[Problem Status](#problem-status) shows the latest progress to all 1000+ questions. Currently we have 302 completed solutions. Note: questions with ♥ mark means that you have to **Subscript to premium membership** of LeetCode to unlock them.
+[Problem Status](#problem-status) shows the latest progress to all 1000+ questions. Currently we have 303 completed solutions. Note: questions with ♥ mark means that you have to **Subscript to premium membership** of LeetCode to unlock them.
 
 ## Contributors
 
@@ -59,6 +59,7 @@
 [Move Zeroes](https://leetcode.com/problems/move-zeroes/)| [Swift](./Array/MoveZeroes.swift)| Easy| O(n)| O(1)|
 [Remove Element](https://leetcode.com/problems/remove-element/)| [Swift](./Array/RemoveElement.swift)| Easy| O(n)| O(1)|
 [Strobogrammatic Number](https://leetcode.com/problems/strobogrammatic-number/)| [Swift](./Array/StrobogrammaticNumber.swift)| Easy| O(n)| O(1)|
+[Can Place Flowers](https://leetcode.com/problems/can-place-flowers/)| [Swift](./Array/CanPlaceFlowers.swift)| Easy| O(n)| O(1)|
 [Two Sum](https://leetcode.com/problems/two-sum/)| [Swift](./Array/TwoSum.swift)| Easy| O(n)| O(n)|
 [Two Sum Less Than K](https://leetcode.com/problems/two-sum-less-than-k/)| [Swift](./Array/TwoSumLessThanK.swift)| Easy| O(nlogn)| O(n)|
 [3Sum](https://leetcode.com/problems/3sum/)| [Swift](./Array/ThreeSum.swift)| Medium| O(n^2)| O(nC3)|