leetcode605+判断是否能完全放完花，左右添加0，trick

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;
    }
};