LeetCode@Array_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 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

java:

public class Solution {
public boolean canPlaceFlowers(int[] flowerbed, int n)
{
int res = 0;
int len = flowerbed.length;

for(int i = 0; i<len ;i++)
{
if(flowerbed[i] == 0)
{
int prev = (i == 0)? 0:flowerbed[i-1];
int next = (i == len-1)? 0:flowerbed[i+1];
if(prev == 0 && next == 0)
{
res++;
flowerbed[i] = 1;
}
}
}
return n <= res;

}

}