leetcode 904. Fruit Into Baskets 水果成篮

Problem: 904. Fruit Into Baskets 水果成篮

滑动窗口的，也就是相邻最长的树数量，需要满足种类<=2，哈希表记录种类数量，若种类数量达到了3则拿到最大值，若到了数组最后拿到最大值以后也要退出，而且相邻的同种类需要跳过否则会超时

Code

class Solution { public: int totalFruit(vector<int>& fruits) { int l = 0, n = fruits.size(), mx = INT_MIN, i, pre; while(l < n-1) { pre = fruits[l]; unordered_set<int> te; for(i = l; i < n; i++) { te.insert( fruits[i] ); if(te.size()==3) { mx = max(mx, i - l); break; } if(i == n-1) { mx = max(mx, i-l+1); break; } } if(i==n-1) break; while(l < n && fruits[++l]==pre); } if(mx == INT_MIN) return 1; return mx; } };