【LeetCode】904. Fruit Into Baskets

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

Add one piece of fruit from this tree to your baskets.  If you cannot, stop.
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 <= tree.length <= 40000
0 <= tree[i] < tree.length

思路：两指针，只涉及两个变量，可以用a，b表示，其中b是最近出现的数，然后cnt表示计数，最关键是维持cntb来计数；

当然也可以用上篇博客的思路，用left和right来表示位置，通过当前值跟前一个值来比较更新right，left通过right来更新

代码：

class Solution {
public:
    int totalFruit(vector<int>& tree) {
        int ans=0,left=0,right=-1,len=tree.size();
        for(int i=1;i<len;i++){
            if(tree[i]==tree[i-1])continue;
            if(right>=0&&tree[i]!=tree[right]){
                ans=max(ans,i-left);
                left=right+1;
            }
            right=i-1;
        }
        return max(ans,len-left);
    }
};   

class Solution {
public:
    int totalFruit(vector<int>& tree) {
        int a=0,ans=0,b=0,cnt_b=0,cur=0;
        for(auto c:tree){
            cur=(c==a||c==b?cur+1:cnt_b+1);
            cnt_b=(c==b?cnt_b+1:1);
            if(c!=b){
                a=b;b=c;
            }
            ans=max(ans,cur);
        }
        return ans;
    }
};