题目
思路:
就是最简单的思路
如果i = 0,判断右边是否为0
如果i = length-1,判断左边是否为0
否则,左右都需要判断。
这个题解的代码写的很妙啊
if(flowerbed[i] == 0 && (i == 0 || flowerbed[i-1]==0) && (i == flowerbed.length-1 || flowerbed[i+1]==0))
具体代码
class Solution {
public boolean canPlaceFlowers(int[] flowerbed, int n) {
int count = 0,i = 0;
while(i < flowerbed.length){
if(flowerbed[i] == 0 && (i == 0 || flowerbed[i-1]==0) && (i == flowerbed.length-1 || flowerbed[i+1]==0)){
flowerbed[i] = 1;
count++;
}
i++;
}
return count >= n;
}
}