leetCode605

开心一刻

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