8/6每日一題(計算最多可以種多花,相鄰不可以是花)

 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.

Given an integer array flowerbed containing 0's and 1's, where 0 means empty and 1 means not empty, and an integer n, return true if n new flowers can be planted in the flowerbed without violating the no-adjacent-flowers rule and false otherwise.

 

Example 1:

Input: flowerbed = [1,0,0,0,1], n = 1
Output: true

Example 2:

Input: flowerbed = [1,0,0,0,1], n = 2
Output: false

 

Constraints:

• 1 <= flowerbed.length <= 2 * 104
• flowerbed[i] is 0 or 1.
• There are no two adjacent flowers in flowerbed.
• 0 <= n <= flowerbed.length\

class Solution:

  def canPlaceFlowers(self, flowerbed: List[int], n: int) -> bool:

    choice=0

    for i in range(len(flowerbed)):

      if flowerbed[i]==0:

        if i==0 or flowerbed[i-1]==0: #相鄰不可以是1

          if i==len(flowerbed)-1 or flowerbed[i+1] ==0:

            #如果i是最後一項或者 下一項是0

            choice +=1

            flowerbed[i]=1 #更新list

    return choice >= n