版权声明：本文为博主原创文章，未经博主允许不得转载。 https://blog.csdn.net/u013554860/article/details/82392239
https://leetcode.com/problems/can-place-flowers/description/
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(flowerbed[i-1]+flowerbed[i]+flowerbed[i+1]==0){
n--;
++i;//跳一个格子
}
}
return n<=0;
}
};