leetcode-solutions/605.py at main · juneguo257/leetcode-solutions · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
class Solution:
    def canPlaceFlowers(self, flowerbed: List[int], n: int) -> bool:
        c = 0
        if (len(flowerbed) == 1):
            return (n == 0 or (n == 1 and flowerbed == [0]))

        for i in range(len(flowerbed)):
            if (i == 0):
                if flowerbed[i+1] == 0 and flowerbed[i] == 0:
                    flowerbed[i] = 1
                    c += 1
            elif (i == len(flowerbed)-1):
                if (flowerbed[i-1] == 0 and flowerbed[i] == 0):
                    flowerbed[i] = 1
                    c += 1
            else:
                if (flowerbed[i-1] == 0 and flowerbed[i+1] == 0 and flowerbed[i] == 0):
                    flowerbed[i] = 1
                    c += 1

        return n <= c