Class Solution
java.lang.Object
g0601_0700.s0605_can_place_flowers.Solution
605 - Can Place Flowers.<p>Easy</p>
<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><strong>Example 1:</strong></p>
<p><strong>Input:</strong> flowerbed = [1,0,0,0,1], n = 1</p>
<p><strong>Output:</strong> true</p>
<p><strong>Example 2:</strong></p>
<p><strong>Input:</strong> flowerbed = [1,0,0,0,1], n = 2</p>
<p><strong>Output:</strong> false</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>
-
Constructor Summary
Constructors -
Method Summary
-
Constructor Details
-
Solution
public Solution()
-
-
Method Details
-
canPlaceFlowers
public boolean canPlaceFlowers(int[] flowerbed, int n)
-