【朱迪的LeetCode刷题笔记】605. Can Place Flowers #Easy #Python
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 = , n = 1
Output: true
Example 2:
Input: flowerbed = , 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
class Solution(object):
def canPlaceFlowers(self, flowerbed, n):
"""
:type flowerbed: List
:type n: int
:rtype: bool
"""
l = len(flowerbed)
i = 0
while i < l:
if n == 0:
return True
if flowerbed == 0:
if i + 1 < l:
if flowerbed == 0:
n -= 1
i += 2
else:
i += 3
else:
return n - 1 == 0
else:
i += 2
return n == 0
https://leetcode.com/problems/can-place-flowers/solutions/3317839/python-simple-solution-easy-to-understand/?envType=study-plan-v2&envId=leetcode-75
Sol1
Python
class Solution:
def canPlaceFlowers(self, flowerbed: List, n: int) -> bool:
if n == 0:
return True
for i in range(len(flowerbed)):
if flowerbed == 0 and (i == 0 or flowerbed == 0) and (i == len(flowerbed)-1 or flowerbed == 0):
flowerbed = 1
n -= 1
if n == 0:
return True
return False
页:
[1]