LeetCode-605. Can Place Flowers [C++][Java]

贫道绝缘子

已于 2022-08-25 08:04:55 修改

阅读量91

点赞数

分类专栏： LeetCode刷题怪文章标签： leetcode java c++

于 2022-02-16 22:20:13 首次发布

本文链接：https://blog.csdn.net/qq_15711195/article/details/122972969

版权

LeetCode刷题怪专栏收录该内容

230 篇文章 3 订阅

订阅专栏

本文介绍了LeetCode的一道编程题目——605. 能种花的地方，内容涉及数组处理和条件判断。题目要求在不违反相邻花朵规则的情况下，判断能否种植指定数量的花朵。解题思路提供了C++和Java两种实现，通过遍历数组，检查空地并更新计数来确定是否能种植n朵花。

摘要由CSDN通过智能技术生成

LeetCode-605. Can Place Flowershttps://leetcode.com/problems/can-place-flowers/

题目描述

You have a long flowerbed in which some of the plots are planted, and some are not. However, flowers cannot be planted in adjacent plots.

Given an integer array flowerbed containing 0's and 1's, where 0 means empty and 1 means not empty, and an integer n, return if n new flowers can be planted in the flowerbed without violating the no-adjacent-flowers rule.

Example 1:

Input: flowerbed = [1,0,0,0,1], n = 1
Output: true

Example 2:

Input: flowerbed = [1,0,0,0,1], n = 2
Output: false

Constraints:

1 <= flowerbed.length <= 2 * 104
flowerbed[i] is 0 or 1.
There are no two adjacent flowers in flowerbed.
0 <= n <= flowerbed.length

解题思路

【C++】

class Solution {
public:
    bool canPlaceFlowers(vector<int>& flowerbed, int n) {
        int len = flowerbed.size(), cnt = 0;
        for(int i= 0; i<len; ++i) {
            if(flowerbed[i] == 0) {
                int pre = i == 0 ? 0 : flowerbed[i - 1];
                int next = i == len - 1 ? 0 : flowerbed[i + 1];
                if (pre == 0 && next == 0) {
                    cnt++;
                    flowerbed[i] = 1;
                }
            }
        }
        return cnt >= n;
    }
};

【Java】

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