605. Can Place Flowers

标签：return   ini   ret   die   bool   new   and   ace   ==   

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.

给出一个01数组，1表示有花，0表示空地，花不能相邻的种，问还能不能再种n朵花。

贪心寻找000然后把000变成010就行

class Solution(object):
    def canPlaceFlowers(self, flowerbed, n):
        """
        :type flowerbed: List[int]
        :type n: int
        :rtype: bool
        """
        flowerbed = [0] + flowerbed + [0]
        for i in range(1, len(flowerbed) - 1, 1):
            if flowerbed[i] != 1 and flowerbed[i - 1] == 0 and flowerbed[i + 1] == 0:
                n -= 1
                flowerbed[i] = 1
        return n <= 0

605. Can Place Flowers

标签：return   ini   ret   die   bool   new   and   ace   ==   

原文地址：https://www.cnblogs.com/whatyouthink/p/13303042.html