LeetCode--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.

---

题意：给你一串数组表示一个花坛，数组中只有0或1，0表示空地可以种花，1表示已经被占用不能再种。再给你一个n表示需要种的花的数量。问你花坛中还能不能种n棵花。种花必须满足相邻的土地为空这一条件，以防止花儿之间竞争资源导致枯死。

思路：

1.从前往后遍历数组，对于当前位置i，判断是否满足i-1，i，i+1同时为空，若为空则可以种植，否则不能。数组边界只需另外一边为空即可。

参考代码：

class Solution {
public:
    bool canPlaceFlowers(vector<int>& flowerbed, int n) {
        int N=flowerbed.size(),cnt=0;
        for(int i=0;i<N&&n;++i){
            if(!flowerbed[i]&&((i==0&&!flowerbed[i+1])||(!flowerbed[i-1]&&!flowerbed[i+1])||(i==N-1&&!flowerbed[i-1]))){
                --n;++i;
            }
        }
        return n==0;
    }
};