605. Can Place Flowers
Easy
2871643Add to ListShare
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 if n
new flowers can be planted in the flowerbed
without violating the no-adjacent-flowers rule.
Example 1:
Input: flowerbed = [1,0,0,0,1], n = 1 Output: true
Example 2:
Input: flowerbed = [1,0,0,0,1], n = 2 Output: false
Constraints:
1 <= flowerbed.length <= 2 * 104
flowerbed[i]
is0
or1
.- There are no two adjacent flowers in
flowerbed
. 0 <= n <= flowerbed.length
class Solution:
def canPlaceFlowers(self, flowerbed: List[int], n: int) -> bool:
"""
assert Solution().canPlaceFlowers([1, 0, 0, 0, 1], 1)
assert not Solution().canPlaceFlowers([1, 0, 0, 0, 1], 2)
"""
for i in range(0, len(flowerbed)):
if i + n > len(flowerbed):
# 没机会了,优化判断
if flowerbed[i] != 0:
continue
if i - 1 >= 0 and flowerbed[i - 1] != 0:
continue
if i + 1 < len(flowerbed) and flowerbed[i + 1] != 0:
continue
n -= 1
flowerbed[i] = 1
return n <= 0