[leetcode]-605. Can Place Flowers（C语言）

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.

bool canPlaceFlowers(int* flowerbed, int flowerbedSize, int n) {
    int place=0,i,j,k;
    if(n==0)
        return true;
    if(flowerbedSize==1&&flowerbed[0]==0||flowerbedSize==2&&flowerbed[0]==0&&flowerbed[1]==0)
        if(n==1)
            return true;
        else
            return false;
    if(flowerbedSize==3)
    {
        if(flowerbed[0]==0&&flowerbed[1]==0&&flowerbed[2]==0)
        {
            if(n<=2)
                return true;
            return false;
        }
        for(i=0;i<2;i++)
            if(flowerbed[i]==0&&flowerbed[i+1]==0)
            {
                if(n==1)
                    return true;
                return false;
            }
    }
    if(flowerbed[0]==0&&flowerbed[1]==0)
    {
        place++;
    }
    for(i=2;i<flowerbedSize-1;i++)
    {
        if(flowerbed[i]==0&&flowerbed[i+1]==0&&flowerbed[i-1]==0)
        {
            place++;
            i++;
        }
    }
    if(flowerbed[flowerbedSize-1]==0&&flowerbed[flowerbedSize-2]==0&&flowerbed[flowerbedSize-3]==1)
        place++;
    if(flowerbed[flowerbedSize-1]==0&&flowerbed[flowerbedSize-2]==0&&flowerbed[flowerbedSize-3]==0)
    {
        if(i==flowerbedSize-1)
            place++;
    }
    if(place<n)
        return false;
    return true;
}