[LeetCode]605. Can Place Flowers 解题报告(C++)

[LeetCode]605. Can Place Flowers 解题报告(C++)

题目描述

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:

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

题目大意

• 给你一个数组. 0 表示 空位. 1 表示非空.
• 求得最多在空位上放置多少植物.使得1与1之间不相邻.
• 再与给定要值的数目比较

解题思路

方法1:

• 主要是要计算 连续 0 的个数.对于左右两边的0要区别处理. eg. 0001和 001. 可以种植的数目为 cnt/2 .而中间的0.如 10001. 可以种植的数目为 (cnt-1)/2
• 所以给左右两边各加一个0 使得 公式相同.
• 即可遍历数字. 计算每次连续0的个数. 然后后 (cnt-1)/2 叠加到最终结果.

代码实现:

class Solution {
public:
    bool canPlaceFlowers(vector<int>& flowerbed, int n) {
        if (flowerbed.empty()) {
            return false;
        }
        flowerbed.insert(flowerbed.begin(), 0);
        flowerbed.push_back(0);

        int len = flowerbed.size();
        int cnt = 0;
        int sum = 0;
        for (int i = 0; i <= len; ++i) {
            if (i<len && flowerbed[i] == 0) {
                cnt++;
            }
            else {
                sum += (cnt - 1) / 2;
                cnt = 0;
            }
        }
        return sum >= n;

    }
};

方法2:

• 同样给左右加两个 0 .
• 再统计连续三个0出现的次数.

代码实现:

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

小结

• -