English
605. Can Place Flowers
Problem Statement
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.
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:
rs
impl Solution {
pub fn can_place_flowers(flowerbed: Vec<i32>, mut n: i32) -> bool {
let mut empty = if flowerbed[0] == 0 { 1 } else { 0 };
for &x in &flowerbed {
if x == 0 {
empty += 1;
} else {
n -= (empty - 1) / 2;
empty = 0;
}
}
n -= empty / 2;
n <= 0
}
}
py
class Solution:
def canPlaceFlowers(self, flowerbed: list[int], n: int) -> bool:
empty = 0 if flowerbed[0] else 1
for f in flowerbed:
if f:
n -= int((empty - 1) / 2)
empty = 0
else:
empty += 1
n -= empty // 2
return n <= 0
go
package main
func canPlaceFlowers(flowerbed []int, n int) bool {
empty := 0
if flowerbed[0] == 0 {
empty = 1
}
for _, f := range flowerbed {
if f == 0 {
empty++
} else {
n -= (empty - 1) / 2
empty = 0
}
}
n -= empty / 2
return n <= 0
}
...