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
SOLUTION:
class Solution:
def canPlaceFlowers(self, flowerbed: List[int], n: int) -> bool:
fn = len(flowerbed)
for i in range(fn):
if flowerbed[i] == 0:
isValid = True
if i > 0 and flowerbed[i - 1] == 1:
isValid = False
if i < fn - 1 and flowerbed[i + 1] == 1:
isValid = False
if isValid:
flowerbed[i] = 1
n = max(n - 1, 0)
return n == 0
Top comments (0)