605. Can Place Flowers

• Difficulty: Easy

• Topics: Array

• Similar Questions:

  • Teemo Attacking

  • Asteroid Collision

Problem:

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:

Solutions:

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