|
| 1 | +<h2><a href="https://leetcode.com/problems/fruit-into-baskets/">904. Fruit Into Baskets</a></h2><h3>Medium</h3><hr><div><p>You are visiting a farm that has a single row of fruit trees arranged from left to right. The trees are represented by an integer array <code>fruits</code> where <code>fruits[i]</code> is the <strong>type</strong> of fruit the <code>i<sup>th</sup></code> tree produces.</p> |
| 2 | + |
| 3 | +<p>You want to collect as much fruit as possible. However, the owner has some strict rules that you must follow:</p> |
| 4 | + |
| 5 | +<ul> |
| 6 | + <li>You only have <strong>two</strong> baskets, and each basket can only hold a <strong>single type</strong> of fruit. There is no limit on the amount of fruit each basket can hold.</li> |
| 7 | + <li>Starting from any tree of your choice, you must pick <strong>exactly one fruit</strong> from <strong>every</strong> tree (including the start tree) while moving to the right. The picked fruits must fit in one of your baskets.</li> |
| 8 | + <li>Once you reach a tree with fruit that cannot fit in your baskets, you must stop.</li> |
| 9 | +</ul> |
| 10 | + |
| 11 | +<p>Given the integer array <code>fruits</code>, return <em>the <strong>maximum</strong> number of fruits you can pick</em>.</p> |
| 12 | + |
| 13 | +<p> </p> |
| 14 | +<p><strong class="example">Example 1:</strong></p> |
| 15 | + |
| 16 | +<pre><strong>Input:</strong> fruits = [<u>1,2,1</u>] |
| 17 | +<strong>Output:</strong> 3 |
| 18 | +<strong>Explanation:</strong> We can pick from all 3 trees. |
| 19 | +</pre> |
| 20 | + |
| 21 | +<p><strong class="example">Example 2:</strong></p> |
| 22 | + |
| 23 | +<pre><strong>Input:</strong> fruits = [0,<u>1,2,2</u>] |
| 24 | +<strong>Output:</strong> 3 |
| 25 | +<strong>Explanation:</strong> We can pick from trees [1,2,2]. |
| 26 | +If we had started at the first tree, we would only pick from trees [0,1]. |
| 27 | +</pre> |
| 28 | + |
| 29 | +<p><strong class="example">Example 3:</strong></p> |
| 30 | + |
| 31 | +<pre><strong>Input:</strong> fruits = [1,<u>2,3,2,2</u>] |
| 32 | +<strong>Output:</strong> 4 |
| 33 | +<strong>Explanation:</strong> We can pick from trees [2,3,2,2]. |
| 34 | +If we had started at the first tree, we would only pick from trees [1,2]. |
| 35 | +</pre> |
| 36 | + |
| 37 | +<p> </p> |
| 38 | +<p><strong>Constraints:</strong></p> |
| 39 | + |
| 40 | +<ul> |
| 41 | + <li><code>1 <= fruits.length <= 10<sup>5</sup></code></li> |
| 42 | + <li><code>0 <= fruits[i] < fruits.length</code></li> |
| 43 | +</ul> |
| 44 | +</div> |
0 commit comments