0
点赞
收藏
分享

微信扫一扫

Leetcode每日刷题之904.水果成篮

class Solution {
public:
    int totalFruit(vector<int>& fruits) 
    {
        int n = fruits.size();
        int hash[100001] = { 0 };
        int len = 0;
        for(int left = 0,right = 0,kinds = 0;right < n;right++)
        {
            if(hash[fruits[right]] == 0)
            {
                kinds++;
            }
            hash[fruits[right]]++;
            while(kinds > 2)
            {
                hash[fruits[left]]--;
                if(hash[fruits[left]] == 0)
                {
                    kinds--;
                }
                left++;
            }
            len = max(len,right - left + 1);
        }
        return len;
    }
};

 

举报

相关推荐

0 条评论