Can Place Flowers

题目描述:

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 number n, 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

Note:

1. The input array won't violate no-adjacent-flowers rule.
2. The input array size is in the range of [1, 20000].
3. n is a non-negative integer which won't exceed the input array size.

题目大意:

题目意思是要种花，种花都要求就是每盆花不能相邻，即要间隔开。
给定过一个数组，其中的元素包括0和1，0表示空地，1表示已经种了都花。问，最多还能种多少花？
模拟种花过程，遍历数组，符合要求的位置进行“种花”操作，并且记录种花盆数即可。

题目代码:

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