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 noadjacentflowers rule.
Example 1:


Example 2:


Note:
 The input array won’t violate noadjacentflowers rule.
 The input array size is in the range of [1, 20000].
 n is a nonnegative integer which won’t exceed the input array size.
使用贪心法求出最多能种多少支花。

