# 904     Fruit Into Baskets

## 904. [Fruit Into Baskets](https://leetcode.com/problems/fruit-into-baskets/description/)

## 1. Question

n a row of trees, the`i`-th tree produces fruit with type `tree[i]`.

You **start at any tree of your choice**, then repeatedly perform the following steps:

1. Add one piece of fruit from this tree to your baskets.  If you cannot, stop.
2. Move to the next tree to the right of the current tree.  If there is no tree to the right, stop.

Note that you do not have any choice after the initial choice of starting tree: you must perform step 1, then step 2, then back to step 1, then step 2, and so on until you stop.

You have two baskets, and each basket can carry any quantity of fruit, but you want each basket to only carry one type of fruit each.

What is the total amount of fruit you can collect with this procedure?

**Example 1:**

```
Input: [1,2,1]
Output: 3
Explanation: We can collect [1,2,1].
```

**Example 2:**

```
Input: [0,1,2,2]
Output: 3
Explanation: We can collect [1,2,2]. If we started at the first tree, we would only collect [0, 1].
```

**Example 3:**

```
Input: [1,2,3,2,2]
Output: 4
Explanation: We can collect [2,3,2,2].If we started at the first tree, we would only collect [1, 2].
```

**Example 4:**

```
Input: [3,3,3,1,2,1,1,2,3,3,4]
Output: 5
Explanation: We can collect [1,2,1,1,2].If we started at the first tree or the eighth tree, we would only collect 4 fruits.
```

**Note:**

1. `1 <= tree.length <= 40000`
2. `0 <= tree[i] < tree.length`

## 2. Implementation

**(1) Two Pointer + Hash**

思路: 维护一个sliding window, 用buckets数组记录当前sliding windows中不同水果的数量，当水果类型大于2时，移动start指针，调整sliding window使得水果类型变成2，最后用res记录最长的满足条件的sliding window

```java
class Solution {
    public int totalFruit(int[] tree) {
        if (tree == null || tree.length == 0) {
            return 0;
        }

        int n = tree.length;
        int[] bucket = new int[n];

        int types = 0;
        int start = 0, end = 0;
        int res = 0;

        while (end < n) {
            if (bucket[tree[end]] == 0) {
                ++types;
            }
            ++bucket[tree[end]];
            ++end;

            while (types > 2) {
                if (bucket[tree[start]] == 1) {
                    --types;
                }
                --bucket[tree[start]];
                ++start;
            }
            res = Math.max(res, end - start);
        }
        return res;
    }
}
```

## 3. Time & Space Complexity

**Two Pointer + Hash:** 时间复杂度O(n), 空间复杂度O(1)


---

# Agent Instructions: Querying This Documentation

If you need additional information that is not directly available in this page, you can query the documentation dynamically by asking a question.

Perform an HTTP GET request on the current page URL with the `ask` query parameter:

```
GET https://protegejj.gitbook.io/oj-practices/chapter1/two-pointers/904-fruit-into-baskets.md?ask=<question>
```

The question should be specific, self-contained, and written in natural language.
The response will contain a direct answer to the question and relevant excerpts and sources from the documentation.

Use this mechanism when the answer is not explicitly present in the current page, you need clarification or additional context, or you want to retrieve related documentation sections.