【朱迪的LeetCode刷题笔记】605. Can Place Flowers #Easy #Python

Judie

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 is 0 or 1.
There are no two adjacent flowers in flowerbed.
0 <= n <= flowerbed.length

Judy
Python

1. class Solution(object):
   
2.     def canPlaceFlowers(self, flowerbed, n):
   
3.         """
   
4.         :type flowerbed: List[int]
   
5.         :type n: int
   
6.         :rtype: bool
   
7.         """
   
8.         l = len(flowerbed)
   
9.         i = 0
   
10.         while i < l:
    
11.             if n == 0:
    
12.                 return True
    
13.             if flowerbed[i] == 0:
    
14.                 if i + 1 < l:
    
15.                     if flowerbed[i + 1] == 0:
    
16.                         n -= 1
    
17.                         i += 2
    
18.                     else:
    
19.                         i += 3
    
20.                 else:
    
21.                     return n - 1 == 0
    
22.             else:
    
23.                 i += 2
    
24.         
    
25.         return n == 0

复制代码

https://leetcode.com/problems/ca ... p;envId=leetcode-75
Sol1
Python

1. class Solution:
   
2.     def canPlaceFlowers(self, flowerbed: List[int], n: int) -> bool:
   
3.         if n == 0:
   
4.             return True
   
5.         for i in range(len(flowerbed)):
   
6.             if flowerbed[i] == 0 and (i == 0 or flowerbed[i-1] == 0) and (i == len(flowerbed)-1 or flowerbed[i+1] == 0):
   
7.                 flowerbed[i] = 1
   
8.                 n -= 1
   
9.                 if n == 0:
   
10.                     return True
    
11.         return False

复制代码