# 605. Can Place Flowers

Suppose 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 - they would compete for water and both would die.

Given a flowerbed (represented as an array containing 0 and 1, where 0 means empty and 1 means not empty), and a number n, return if n new flowers can be planted in it 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
``````

Note:

1. The input array won’t violate no-adjacent-flowers rule.
2. The input array size is in the range of [1, 20000].
3. n is a non-negative integer which won’t exceed the input array size.

``````class Solution {
public:
bool canPlaceFlowers(vector<int>& flowerbed, int n) {
if (flowerbed.empty()) return false;
if (flowerbed[0] == 0) flowerbed.insert(flowerbed.begin(), 0);
if (flowerbed.back() == 0) flowerbed.push_back(0);
int len = flowerbed.size(), cnt = 0, sum = 0;
for (int i = 0; i <= len; ++i) {
if (i < len && flowerbed[i] == 0) ++cnt;
else {
sum += (cnt - 1) / 2;
cnt = 0;
}
}
return sum >= n;
}
};
``````

``````class Solution {
public:
bool canPlaceFlowers(vector<int>& flowerbed, int n) {
for (int i = 0; i < flowerbed.size(); ++i) {
if (n == 0) return true;
if (flowerbed[i] == 0) {
int next = (i == flowerbed.size() - 1 ? 0 : flowerbed[i + 1]);
int pre = (i == 0 ? 0 : flowerbed[i - 1]);
if (next + pre == 0) {
flowerbed[i] = 1;
--n;
}
}
}
return n <= 0;
}
};
``````

``````class Solution {
public:
bool canPlaceFlowers(vector<int>& flowerbed, int n) {
flowerbed.insert(flowerbed.begin(), 0);
flowerbed.push_back(0);
for (int i = 1; i < flowerbed.size() - 1; ++i) {
if (n == 0) return true;
if (flowerbed[i - 1] + flowerbed[i] + flowerbed[i + 1] == 0) {
--n;
++i;
}
}
return n <= 0;
}
};
``````

Teemo Attacking

https://discuss.leetcode.com/topic/91376/simplest-c-code

https://discuss.leetcode.com/topic/91303/java-greedy-solution-o-flowerbed-beats-100

LeetCode All in One 题目讲解汇总(持续更新中…)

 微信打赏 Venmo 打赏
（欢迎加入博主的知识星球，博主将及时答疑解惑，并分享刷题经验与总结，试运营期间前五十位可享受半价优惠～）

×

Help us with donation