public static boolean canPlaceFlowers(int[] flowerbed, int n) {
int num = 0;
if(flowerbed.length == 1 && flowerbed[0] == 0) {
flowerbed[0] = 1;
num++;
}
if(flowerbed[0] == 0 && flowerbed[1] != 1 && flowerbed.length >= 1) {
flowerbed[0] = 1;
num++;
}
for(int i = 1; i < flowerbed.length - 1; i++) {
if(flowerbed[i] == 0 && flowerbed[i-1]!= 1 && flowerbed[i+1] != 1) {
flowerbed[i] = 1;
num++;
}
}
if (flowerbed[flowerbed.length-1] == 0 && flowerbed[flowerbed.length-2] != 1) {
num++;
}
Boolean is = (n <= num) ? true : false;
return is;
}
605. 种花问题
最新推荐文章于 2024-10-09 22:28:58 发布