[leetcode] 605. Can Place Flowers

原创

是念 2022-08-11 17:29:12 博主文章分类：leetcode ©著作权

©著作权归作者所有：来自51CTO博客作者是念的原创作品，请联系作者获取转载授权，否则将追究法律责任

Description

Suppose 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 - they would compete for water and both would die.

Given a flowerbed (represented as an array containing 0 and 1, where 0 means empty and 1 means not empty), and a number n, return if n new flowers can be planted in it 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

Note:

The input array won’t violate no-adjacent-flowers rule.
The input array size is in the range of [1, 20000].
n is a non-negative integer which won’t exceed the input array size.

分析

题目的意思是：
给你一个整数的数字，0代表是空，1代表是非空，然后让你填n个1，使得1不相邻。

这是一道easy型的题目，我的解法很直接。直接把合适的位置算出来，然后看数量能否达到给出的要求就行了。

代码

class Solution {
public:
    bool canPlaceFlowers(vector<int>& flowerbed, int n) {
        int m=flowerbed.size();
        int i=0;
        int cnt=0;
        while(i<m){
            if(flowerbed[i]==1){
                i+=2;
            }else if(i+1<m&&flowerbed[i+1]==0){
                cnt++;
                i+=2;
            }else if(i==m-1&&flowerbed[i-1]==0){
                cnt++;
                break;
            }else{
                i++;
            }
        }
        return cnt>=n;
    }
};