LeetCode#605: Can Place Flowers

Description

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

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

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

Note

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

Solution

这道题是个easy题，但是如果没有想清楚思路就动手写的话很容易因为没有考虑全面而越写越混乱，这也是此题通过率只有百分之三十左右的原因。

由题可知，要放入鲜花的位置两边都不能有鲜花，即对于1 0 0 0 1 鲜花只能放在下标为2的位置。但要注意有一个例外，即当头尾为0的时候：0 0 1 1 0 0 ，在这种情况下鲜花既可以放在第一个位置，也可以放在最后一个位置。

我们每次找到一个可以放入鲜花的位置，就将计数器加一，最终用计数器与传入的参数n比较大小就可以知道是否能插入鲜花了。

class Solution {
    public boolean canPlaceFlowers(int[] flowerbed, int n) {
    	int cap = 0;
    	
    	for(int i = 0; i < flowerbed.length; i++) {
    		if(flowerbed[i] == 0 && (i == 0 || flowerbed[i-1] == 0) && (i == flowerbed.length-1 || flowerbed[i+1] == 0)) {
    			cap++;
    			flowerbed[i] = 1;
    		}
    	}
        return cap - n >= 0 ? true : false;
    }
}