605. 种花问题

class Solution:
def canPlaceFlowers(self, flowerbed: List[int], n: int) -> bool:
if len(flowerbed) == 1:
if flowerbed[0] == 0:
return 1 >= n
else:
return 0 >= n
else:
i = 0
count = 0
while i < len(flowerbed):
if i == 0 and flowerbed[0] == 0 and flowerbed[1] == 0:
flowerbed[0] = 1
count += 1
i += 2
elif i < len(flowerbed) - 1 and flowerbed[i - 1] == 0 and flowerbed[i] == 0 and flowerbed[i + 1] == 0:
flowerbed[i] = 1
count += 1
i += 2
elif i == len(flowerbed) - 1 and flowerbed[i - 1] == 0 and flowerbed[i] == 0:
flowerbed[i] = 1
count += 1
i += 2
else:
i += 1
return count >= n

605. 种花问题

原文：https://www.cnblogs.com/best-you-articles-040612/p/14925104.html