难度:easy
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:
- 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.
思路: 自己写过一个,用一个for 循环内套while循环找到所有连续的0,然后用( x-1)/2 算出可能的栽花位置,再与n 做比较,但是超时。
借鉴别人的方法。用enumerate()函数同时遍历 索引和element。利用flag实现隔一个数取1个位置。找到一个位置就从n中减1.
esle中排除1的前一位是0,但是已经计入栽花位点的情况。最后若n<=0,则判断正确。