URL: LeetCode Problem
Problem Description
You have a long flowerbed in which some of the plots are planted, and some are not. However, flowers cannot be planted in adjacent plots.
Given an integer array flowerbed containing 0's and 1's, where 0 means empty and 1 means not empty, and an integer n, return true if n new flowers can be planted in the flowerbed without violating the no-adjacent-flowers rule and false otherwise.
Examples:
Example 1:
Input: flowerbed = [1,0,0,0,1], n = 1 Output: true
Constraints:
1 <= flowerbed.length <= 2 * 104 flowerbed[i] is 0 or 1. There are no two adjacent flowers in flowerbed. 0 <= n <= flowerbed.length
Python3 Solution
class Solution:
def canPlaceFlowers(self, flowerbed: List[int], n: int) -> bool:
if n == 0: return True
cur = 0
while cur < len(flowerbed):
if flowerbed[cur] == 0 and (flowerbed[cur-1] == 0 or cur == 0) and (cur == len(flowerbed)-1 or flowerbed[cur+1] == 0):
flowerbed[cur] = 1
n -= 1
cur += 1
if n == 0:
return True
return False