面试必考精华版Leetcode605. 种花问题 day2

题目：

---

 

 

代码(首刷看解析）：

class Solution {
public:
    bool canPlaceFlowers(vector<int>& flowerbed, int n) {
        if (flowerbed.size()==0) return false;

        int CountOfZero=1;
        int Flowers=0;
        for(int num:flowerbed){
            if(num==0){
                CountOfZero++;
            }else{
                Flowers+=(CountOfZero-1)/2;
                if(Flowers>=n) return true;
                CountOfZero = 0;
            }
        }
        CountOfZero++;
        Flowers+=(CountOfZero-1)/2;

        return Flowers>=n;
    }
};