1138. Can Place Flowers

Description

中文English

Suppose you have a long flowerbed in which some of the pots 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.

bool canPlaceFlowers(vector<int> &flowerbed, int n) { // Write your code here const int size = flowerbed.size(); if(size == 0){ return false; } int count = 0; for(int i = 0; i < size; i++){ if(flowerbed[i] == 0 && (flowerbed[i - 1] == 0 || i == 0) && (flowerbed[i + 1] == 0 || i == size - 1)){ count++; flowerbed[i] = 1; } } return count >= n; }