leetcode 605. 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 = 1Output: True

Example 2:

Input: flowerbed = [1,0,0,0,1], n = 2Output: 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.

看看一个花室里面能放多少花。。

代码如下：

bool canPlaceFlowers(int* flowerbed, int flowerbedSize, int n) {    for(int l=0;l<flowerbedSize&&n>0;l++)    {        if(*(flowerbed+l)==0)        {            int flag=0;            if(l-1>=0)            {                if(*(flowerbed+l-1)==0)                    flag++;            }            else                flag++;            if(l+1<flowerbedSize)            {                if(*(flowerbed+l+1)==0)                    flag++;            }            else                flag++;            if(flag==2)            {                *(flowerbed+l)=1;                n--;            }        }    }    if(n==0)        return true;    return false;}

顺序检测相邻的花，不影响就好了。