week5

605. Can Place Flowers          

605：

题意：

Suppose you have a long flowerbed in which some of the plots are planted and some are not. However, flowers cannot be planted in adjacent plots - they would compete for water and both would die.

Given a flowerbed (represented as an array containing 0 and 1, where 0 means empty and 1 means not empty), and a numbern, return if n new flowers can be planted in it without violating the no-adjacent-flowers rule.

Example 1:

Input: flowerbed = [1,0,0,0,1], n = 1
Output: True

Example 2:

Input: flowerbed = [1,0,0,0,1], n = 2
Output: False

解析：

两朵花不能邻近，除此之外检索空位即可

代码：

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