-
Notifications
You must be signed in to change notification settings - Fork 0
/
605.py
46 lines (38 loc) · 1.58 KB
/
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
46
# 605. Can Place Flowers
# Suppose 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 - they would compete for water and both would die.
# Given a flowerbed (represented as an array containing 0 and 1, where 0 means empty and 1 means not empty),
# and a number n, return if n new flowers can be planted in it 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
# Note:
# The input array won't violate no-adjacent-flowers rule.
# The input array size is in the range of [1, 20000].
# n is a non-negative integer which won't exceed the input array size.
from typing import List
class Solution:
def canPlaceFlowers(self, flowerbed: List[int], n: int) -> bool:
flowerbed = [0] + flowerbed + [0]
length = len(flowerbed)
for i in range(1, length - 1):
if not flowerbed[i - 1] and not flowerbed[i + 1] and not flowerbed[i]:
flowerbed[i] = 1
n -= 1
if n <= 0:
return True
return n == 0
if __name__ == "__main__":
from util import Test
s = Solution()
t = Test(s.canPlaceFlowers)
t.equal(True, [1, 0, 0, 0, 1], 1)
t.equal(False, [1, 0, 0, 0, 1], 2)
t.equal(False, [1, 0, 1, 0, 1, 0, 1], 1)
t.equal(True, [1, 0, 1, 0, 1, 0, 1], 0)
t.equal(True, [0, 0, 1, 0, 1], 1)
t.equal(True, [1, 0, 0, 0, 1, 0, 0], 2)
t.equal(True, [0, 0, 0, 0, 1, 0, 0], 0)