-
Notifications
You must be signed in to change notification settings - Fork 0
/
canPlaceFlowers.js
50 lines (36 loc) · 1.36 KB
/
canPlaceFlowers.js
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
// LeetCode #605. Can Place Flowers
/* Instructions
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.
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
Constraints:
1 <= flowerbed.length <= 2 * 104
flowerbed[i] is 0 or 1.
There are no two adjacent flowers in flowerbed.
0 <= n <= flowerbed.length
*/
// Solution
const canPlaceFlowers = (flowerbed, n) => {
for (let i = 0; i < flowerbed.length && n !== 0; i++) {
if (
flowerbed[i] === 0 &&
flowerbed[i - 1] !== 1 &&
flowerbed[i + 1] !== 1
) {
n--
i++
}
}
return n === 0
}
// Explanation
// Loop through the flowerbed array as long as i is less than the length and n is not equal to 0
// If the element at the current index is 0, and the previous element isn't 1, and the next index isn't 1, then...
// decrement n by 1
// increment i by 1
// Then, by the end of the loop, return n === 0, which will return either true or false