Can Place Flowers

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 k, return if k new flowers can be planted in the flowerbed without violating the no-adjacent-flowers rule.

Input Format:

First parameter: integer N

Second parameter: integer array flowerbed of size N.

Third parameter: integer k

Output Format:

Return the number.

Example 1:

Input: 
5
1 0 0 0 1
1
Output: 
1

Example 2:

Input:
5
1 0 0 0 1
2
Output: 
0

Constraints:

• 1 <= flowerbed.length <= 2 * 10⁴
• flowerbed[i] is 0 or 1.
• There are no two adjacent flowers in flowerbed.
• 0 <= k <= flowerbed.length
• Time complexity: O(n)
• Space complexity: O(1)