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.

&nbsp;
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

&nbsp;
Constraints:


	1 &lt;= flowerbed.length &lt;= 2 * 104
	flowerbed[i] is 0 or 1.
	There are no two adjacent flowers in flowerbed.
	0 &lt;= n &lt;= flowerbed.length


class Solution:
    def canPlaceFlowers(self, flowerbed: List[int], n: int) -> bool:
        f = [0] + flowerbed + [0]

        i, could_plant = 1, 0
        while could_plant < n and i < len(f) - 1:
            if f[i + 1]:
                # 0 0 1 -> skip 3
                i += 3
            elif f[i]:
                # 0 1 0 -> skip 2
                i += 2
            elif f[i - 1]:
                # 1 0 0 -> skip 1
                i += 1
            else:
                # 0 0 0 -> plant, becomes 0 1 0 -> skip 2
                could_plant += 1
                i += 2

        return n <= could_plant
class Solution {
    public boolean canPlaceFlowers(int[] flowerbed, int n) {
        if(flowerbed[0] != 1){
            n--;
            flowerbed[0] = 1;   
        }
        for(int i = 1; i < flowerbed.length; i++){
            if(flowerbed[i - 1] == 1 && flowerbed[i] == 1){
                flowerbed[i - 1] = 0;
                n++;
            }
            if(flowerbed[i - 1] != 1 && flowerbed[i] != 1){
                flowerbed[i] = 1;
                n--;
            }
        }
        return (n <= 0) ? true: false;
    }
}
class Solution {
public:
    bool canPlaceFlowers(vector<int>& flowerbed, int n) {
       int count = 1;
    int result = 0;
    for(int i=0; i<flowerbed.size(); i++) {
        if(flowerbed[i] == 0) {
            count++;
        }else {
            result += (count-1)/2;
            count = 0;
        }
    }
    if(count != 0) result += count/2;
    return result>=n; 
    }
};
/**
 * @param {number[]} flowerbed
 * @param {number} n
 * @return {boolean}
 */
var canPlaceFlowers = function(flowerbed, n) {
    for(let i=0 ; i<flowerbed.length ; i++) {
        if((i===0 || flowerbed[i-1]===0) && flowerbed[i]===0 && (i===flowerbed.length-1 || flowerbed[i+1]===0)) {
            flowerbed[i]=1;
            n--;
        }
    }
    return n < 1;
};
Can Place Flowers