Can Place Flowers

最新推荐文章于 2022-02-05 22:23:01 发布

寂寞灵魂

最新推荐文章于 2022-02-05 22:23:01 发布

阅读量185

点赞数

分类专栏： leetcode

本文链接：https://blog.youkuaiyun.com/riverflowrand/article/details/105799215

版权

leetcode 专栏收录该内容

23 篇文章

订阅专栏

本文介绍了一种在一维花园中种植花卉的算法，确保每朵花之间有足够的空隙。通过遍历花园床数组，检查每个位置是否可以种植花朵，并更新计数器以跟踪已种植的花朵数量。该算法在效率上表现优异，运行时间为1毫秒，内存使用为41.3MB。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

可以种植的情况(下标 i)：

i == 0 && arr[i+1] == o && arr[i] = 0;
i == arr.length - 1 && arr[i] == 0 && arr[i-1] == 0;
arr[i] == 0 && arr[i-1] == 0 && arr[i+1] == 0.

/**
Runtime: 1 ms, faster than 94.88% of Java online submissions for Can Place Flowers.

Memory Usage: 41.3 MB, less than 7.14% of Java online submissions for Can Place Flowers.
*/
public class Solution {
    public boolean canPlaceFlowers(int[] flowerbed, int n) {
        int i = 0, count = 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;
    }
}