605. Can Place Flowers
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
Rust Solution
struct Solution;
impl Solution {
fn can_place_flowers(mut flowerbed: Vec<i32>, n: i32) -> bool {
let m = flowerbed.len();
let mut sum = 0;
for i in 0..m {
if flowerbed[i] == 0 {
if i == 0 {
sum += 1;
flowerbed[i] = 1;
} else {
if flowerbed[i - 1] == 0 {
sum += 1;
flowerbed[i] = 1;
}
}
} else {
if i > 0 && flowerbed[i - 1] == 1 {
sum -= 1;
}
}
}
sum >= n
}
}
#[test]
fn test() {
let flowerbed: Vec<i32> = vec![1, 0, 0, 0, 1];
assert_eq!(Solution::can_place_flowers(flowerbed, 1), true);
let flowerbed: Vec<i32> = vec![1, 0, 0, 0, 1];
assert_eq!(Solution::can_place_flowers(flowerbed, 2), false);
}
Having problems with this solution? Click here to submit an issue on github.