LeetCode 605. Can Place Flowers

题目

LeetCode 605. Can Place Flowers_第1张图片

代码

class Solution:
    def canPlaceFlowers(self, flowerbed, n):
        """
        :type flowerbed: List[int]
        :type n: int
        :rtype: bool
        """
        length = len(flowerbed)
        count = 0
        for i in range(length):
            if flowerbed[i]: continue
            left = 0 if i == 0 else flowerbed[i - 1]
            right = 0 if i == length - 1 else flowerbed[i + 1]
            if not left and not right:
                flowerbed[i] = 1
                count += 1
        return count >= n

你可能感兴趣的:(算法-贪心)