class Solution {
public boolean canPlaceFlowers(int[] flowerbed, int n) {
int res=0;
for(int i=0;i<flowerbed.length;i++){
if(flowerbed[i]==1){
continue;
}
int pre=0,next=0;
if(i!=0){
pre=flowerbed[i-1];
}
if(i!=flowerbed.length-1){
next=flowerbed[i+1];
}
if(pre==0 && next==0){
res++;
flowerbed[i]=1;
}
}
return res>=n;
}
}