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. ``` var canPlaceFlowers = function(flowerbed, n) { var r = 0; for(var i = 0;i< flowerbed.length; i++) { // 如果第i个位子是 0，并且第i个位子的前后都不是1（也是0）， // 那么在第i个位子种花，并且r+1； if(flowerbed[i]==0 && flowerbed[i-1]!==1 && flowerbed[i+1]!==1) { ++r; flowerbed.splice(i,1,1); } } if (n<=r) { return true } else { return false }; }; ```