EN VI

Algorithm - Violate No Adjacent Flower Rule?

2024-03-16 01:30:11
How to Algorithm - Violate No Adjacent Flower Rule

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 true if n new flowers can be planted in the flowerbed without violating the no-adjacent-flowers rule and false otherwise.

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

Does anyone know why in this case the output 1 is true? Input: [0,0,1,0,0] 1 Output: false Expected: true

Solution:

return if n (amount of) new flowers can be planted in the flowerbed without violating the no-adjacent-flowers rule.

so its not n HAS to be Max amount possible to be planted. its if N is less than or equal to max planted.

Answer

Login


Forgot Your Password?

Create Account


Lost your password? Please enter your email address. You will receive a link to create a new password.

Reset Password

Back to login