1138. 能否放置花

class Solution:
    """
    @param flowerbed: an array
    @param n: an Integer
    @return: if n new flowers can be planted in it without violating the no-adjacent-flowers rule
    """
    ‘‘‘
    大致思路:
    1.分两种情况
    当前为1的话，那么跳过，下一位必须为0，也跳过
    当前为0的话，那么判断下一位是否为1，如果为1，跳过。否则赋值1
    2.初始化count，如果count次数==n的时候，说明是可以放置那么多花的，返回True，否则False
    ‘‘‘
    def canPlaceFlowers(self,flowerbed, n):
        if n == 0 or (flowerbed == [0] and n == 1):
            return True
        count = 0
        flag = True
        for i in range(len(flowerbed)-1):
            if flowerbed[i] == 0:
                if flag == False:
                    flag = True
                    continue
                elif flag == True:
                    if flowerbed[i+1] == 0:
                        ##直接赋值，不赋值也可以
                        flowerbed[i] = 1
                        count += 1
                        flag = False
                        if count == n:
                            return True
            else:
                flag = False
        return False