1138. 能否放置花

/*
* 输入: flowerbed = [1,0,0,0,1], n = 1 输出: True 样例2
*
* 输入: flowerbed = [1,0,0,0,1], n = 2 输出: False
*/
public boolean canPlaceFlowers(int[] flowerbed, int n) {
// Write your code here
boolean falg = false;
int count = 0;
for (int i = 1; i < flowerbed.length; i+=2) {
if(flowerbed[i-1] != 1 && flowerbed[i] != 1) {
count++;
}
if(count>=n) {
falg = true;
}
}
return falg;
}