Leetcode-904 Fruit Into Baskets(水果成篮)

class Solution
{
    public:
        int totalFruit(vector<int>& tree)
        {
            vector<pair<int,int>> dealList;
            int curType = tree[0];
            int curSum = 1;
            for(int i = 1; i < tree.size(); i ++)
            {
                if(tree[i]==curType)
                    curSum ++;
                else
                {
                    dealList.push_back(make_pair(curType,curSum));
                    curSum = 1;
                    curType = tree[i];
                }
            }
            dealList.push_back(make_pair(curType,curSum));

        //    for(auto d:dealList)
        //        cout << d.first << " " << d.second << endl;
        //    cout << endl;

            int result = dealList[0].second;
            int max = 1;
            int typeA = dealList[0].first,typeB = -1;
            int justI;
            for(int i = 1; i < dealList.size(); i ++)
            {
                if(dealList[i].first != typeA && typeB == -1)
                {
                    typeB = dealList[i].first;
                    result += dealList[i].second;
                    justI = i;
                    //cout << dealList[i].first << endl;
                }
                else if(dealList[i].first == typeA || dealList[i].first==typeB)
                {
                    result += dealList[i].second;
                    //    cout << dealList[i].first << endl;
                }
                else if(dealList[i].first != typeA && dealList[i].first != typeB)
                {
                //    cout << dealList[i].first << endl;
                    result = dealList[justI].second;
                    i = justI;
                    typeB = -1;
                    typeA = dealList[justI].first;
                }
                //    cout << dealList[i].first << endl;
                if(result > max)
                    max = result;
            }
            if(result > max)
                max = result;
            return max;
        }
};