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:**

1 2 |
<b>Input:</b> flowerbed = [1,0,0,0,1], n = 1 <b>Output:</b> True |

**Example 2:**

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

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 |
class Solution(object): def canPlaceFlowers(self, flowerbed, n): z = 1 for i in flowerbed: if i == 0: z+=1 if z==3: n-=1 z = 1 else: z = 0 if z == 2: n -= 1 return n<=0 |