题目链接:https://leetcode-cn.com/problems/fruit-into-baskets/
题意即找到最长的只包含两种元素的子串,双指针法,右指针遍历,cnt数组记录各元素出现的数量,count记录当前窗口内的元素种类数,若大于2则左指针右移。
代码如下:
class Solution {
public:
int totalFruit(vector<int>& a) {
int len = a.size();
int i = 0, j = 0;
int cnt[40005] = {0};
int count = 0;
int res = 0;
while(j < len) {
if(cnt[a[j]] == 0) {
count++;
}
cnt[a[j]]++;
while(count > 2) {
cnt[a[i]]--;
if(cnt[a[i]] == 0) {
count--;
}
i++;
}
res = max(res, j - i + 1);
j++;
}
return res;
}
};