-
Notifications
You must be signed in to change notification settings - Fork 0
/
can-place-flowers_605.py
45 lines (38 loc) · 1.66 KB
/
can-place-flowers_605.py
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
# 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
# ---------------------------------------Runtime 165 ms Beats 77.99% Memory 16.6 MB Beats 99.52%---------------------------------------
class Solution:
def canPlaceFlowers(self, flowerbed: list[int], n: int) -> bool:
plantIndex = 0
planted = 0
while plantIndex <= len(flowerbed) - 1:
if (
plantIndex + 1 > len(flowerbed) - 1
and flowerbed[plantIndex - 1] != 1
and flowerbed[plantIndex] != 1
):
flowerbed[plantIndex] = 1
planted += 1
elif (
plantIndex == 0
and flowerbed[plantIndex] != 1
and flowerbed[plantIndex + 1] != 1
):
flowerbed[plantIndex] = 1
planted += 1
elif (
plantIndex + 1 < len(flowerbed) - 1
and flowerbed[plantIndex - 1] != 1
and flowerbed[plantIndex] != 1
and flowerbed[plantIndex + 1] != 1
):
flowerbed[plantIndex] = 1
planted += 1
plantIndex += 1
return planted >= n