Leetcode 605. 種花問題 (簡單貪心，能種就種）

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