mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-11-04 11:43:12 +08:00
22 lines
1.1 KiB
HTML
22 lines
1.1 KiB
HTML
<p>You have a long flowerbed in which some of the plots are planted, and some are not. However, flowers cannot be planted in <strong>adjacent</strong> plots.</p>
|
|
|
|
<p>Given an integer array <code>flowerbed</code> containing <code>0</code>'s and <code>1</code>'s, where <code>0</code> means empty and <code>1</code> means not empty, and an integer <code>n</code>, return <em>if</em> <code>n</code> new flowers can be planted in the <code>flowerbed</code> without violating the no-adjacent-flowers rule.</p>
|
|
|
|
<p> </p>
|
|
<p><strong>Example 1:</strong></p>
|
|
<pre><strong>Input:</strong> flowerbed = [1,0,0,0,1], n = 1
|
|
<strong>Output:</strong> true
|
|
</pre><p><strong>Example 2:</strong></p>
|
|
<pre><strong>Input:</strong> flowerbed = [1,0,0,0,1], n = 2
|
|
<strong>Output:</strong> false
|
|
</pre>
|
|
<p> </p>
|
|
<p><strong>Constraints:</strong></p>
|
|
|
|
<ul>
|
|
<li><code>1 <= flowerbed.length <= 2 * 10<sup>4</sup></code></li>
|
|
<li><code>flowerbed[i]</code> is <code>0</code> or <code>1</code>.</li>
|
|
<li>There are no two adjacent flowers in <code>flowerbed</code>.</li>
|
|
<li><code>0 <= n <= flowerbed.length</code></li>
|
|
</ul>
|