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 <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 <code>true</code> if <code>n</code> new flowers can be planted in the <code>flowerbed</code> without violating the no-adjacent-flowers rule and <code>false</code> otherwise.
Example 1:
<pre><code class="lang-python">Input: flowerbed = [1,0,0,0,1], n = 1
Output: true
</code></pre>
Example 2:
<pre><code class="lang-python">Input: flowerbed = [1,0,0,0,1], n = 2
Output: false
</code></pre>
Constraints:
<ul>
<li><code>1 &lt;= flowerbed.length &lt;= 2 * 10&lt;sup&gt;4&lt;/sup&gt;</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 &lt;= n &lt;= flowerbed.length</code>
</li>
</ul>
Solution:
<pre><code class="lang-python">class Solution:
 def canPlaceFlowers(self, flowerbed: List[int], n: int) -&gt; bool:
 f = [0] + flowerbed + [0]

 for i in range(1, len(f)-1): # skip first and last
 if f[i-1] == 0 and f[i] == 0 and f[i+1] == 0:
 f[i] = 1
 n -= 1
 return n &lt;= 0
</code></pre>

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:**

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

**Example 2:**

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

**Constraints:**

* `1 <= flowerbed.length <= 2 * 104`
 
* `flowerbed[i]` is `0` or `1`.
 
* There are no two adjacent flowers in `flowerbed`.
 
* `0 <= n <= flowerbed.length`
 

Solution:

```python
class Solution:
 def canPlaceFlowers(self, flowerbed: List[int], n: int) -> bool:
 f = [0] + flowerbed + [0]

 for i in range(1, len(f)-1): # skip first and last
 if f[i-1] == 0 and f[i] == 0 and f[i+1] == 0:
 f[i] = 1
 n -= 1
 return n <= 0
```

605. Can Place Flowers