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 nnew 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.

 1 public class Solution {
 2     public boolean canPlaceFlowers(int[] flowerbed, int n) {
 3         int len = flowerbed.length;
 4         if (len == 1) return !(flowerbed[0] == 1 && n >= 1);
 5         
 6         for (int i = 0; i < len; i++) {
 7             if (flowerbed[i] == 0) {
 8                 int zeros = 0, j = i;
 9                 while (j < len && flowerbed[j] == 0) {
10                     zeros++;
11                     j++;
12                 }
13                 
14                 if (j < len && i > 0) n -= (zeros - 1) / 2;
15                 else if (i == 0 && j == len) n -= (zeros + 1) / 2;
16                 else n -= zeros / 2;
17                 
18                 i = j;
19             }
20         }
21         return n <= 0;
22     }
23 }

 

转载于:https://www.cnblogs.com/amazingzoe/p/7007800.html