0
点赞
收藏
分享

微信扫一扫

605. 种花问题

路西法阁下 2022-07-29 阅读 75


605. 种花问题_java

 

​​点此查看官方详细题解​​

class Solution {
public boolean canPlaceFlowers(int[] flowerbed, int n) {
int count = 0;
int m = flowerbed.length;
int prev = -1;
for (int i = 0; i < m; i++) {
if (flowerbed[i] == 1) {
if (prev < 0) {
count += i / 2;
} else {
count += (i - prev - 2) / 2;
}
prev = i;
}
}
if (prev < 0) {
count += (m + 1) / 2;
} else {
count += (m - prev - 1) / 2;
}
return count >= n;
}
}

 

举报

相关推荐

0 条评论