-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy path605.Can_we_place_flower.py
More file actions
41 lines (32 loc) · 1.22 KB
/
605.Can_we_place_flower.py
File metadata and controls
41 lines (32 loc) · 1.22 KB
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
# 605. 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 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
def canPlaceFlowers(flowerbed, n):
if n==0: return True
for i in range(len(flowerbed)):
if flowerbed[i]==0 and (i==0 or flowerbed[i-1]==0) and (i==len(flowerbed)-1 or flowerbed[i+1]==0):
flowerbed[i]=1
n-=1
if n==0: return True
return False
def canPlaceFlowers(flowerbed, n):
arr2 = [0] + flowerbed + [0]
count = 0
for i in range(1,len(flowerbed)+1):
if arr2[i]==0 and arr2[i-1]==0 and arr2[i+1]==0 :
count+=1
arr2[i] = 1
if count>=n:
return True
else:
return False
print(canPlaceFlowers([1,0,0,0,1],1))