【LeetCode】605. Can Place Flowers 种花问题（Easy）（JAVA）每日一题

【LeetCode】605. Can Place Flowers 种花问题（Easy）（JAVA）

题目地点: https://leetcode.com/problems/can-place-flowers/
题目形貌：

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 if n new flowers can be planted in the flowerbed without violating the no-adjacent-flowers rule.
Example 1:

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

复制代码

Example 2:

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

复制代码

Constraints:
<ul>1