LeetCode | 605. Can Place Flowers

最新推荐文章于 2024-11-08 23:27:36 发布

1LOVESJohnny

最新推荐文章于 2024-11-08 23:27:36 发布

阅读量398

点赞数

分类专栏： LeetCode 文章标签：花床布局相邻规则空地利用花的数量算法优化

本文链接：https://blog.csdn.net/iLOVEJohnny/article/details/123884717

版权

LeetCode 专栏收录该内容

285 篇文章 0 订阅

订阅专栏

.

题目

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 * 10^4
flowerbed[i] is 0 or 1.
There are no two adjacent flowers in flowerbed.
0 <= n <= flowerbed.length

.

代码

class Solution {
public:
    bool canPlaceFlowers(vector<int>& flowerbed, int n) {
        int count0 = 1, num1 = 0;
		for (int i = 0; i < flowerbed.size(); i++)
		{
			if (flowerbed[i] == 1)
				count0 = 0;
			else 
			{
				count0++;
				if (count0 == 3)
				{
					num1++;
					count0 -= 2;
				}
			}
		}
        if(count0 == 2)
            num1 ++;
		if (num1 >= n || (flowerbed.size() == 1 && n == 1 && !flowerbed[0]))
			return true;
		else
			return false;
    }
};