Runtime 175 ms (Top 75.63%) | Memory 71.0 MB (Top 50.63%)

Author: AnasImloul

scripts/algorithms/F/Fruit Into Baskets/Fruit Into Baskets.cpp

@@ -1,24 +1,32 @@
 class Solution {
 public:
     int totalFruit(vector<int>& fruits) {
-        int i=0;int j=0;int res=INT_MIN;
-        unordered_map<int,int> mp;
+        int i=0, j=0, ans = 1;
+        unordered_map<int, int>mp;
         while(j<fruits.size()){
             mp[fruits[j]]++;
-            if(mp.size()<=2){ // here instead of using only mp.size==2 , we are using <=2, because ,in case of input [1,1] ,here map size is <2 but we need to update result.
-                res=max(res,j-i+1); 
+            
+            if(mp.size()<2){
+                ans = max(ans, j-i+1);
+                j++;
+            }
+            else if(mp.size()==2){
+                ans = max(ans, j-i+1);
                 j++;
             }
             else if(mp.size()>2){
                 while(mp.size()>2){
                     mp[fruits[i]]--;
-                    if(mp[fruits[i]]==0) mp.erase(fruits[i]);
+                    if(mp[fruits[i]]==0)
+                        mp.erase(fruits[i]);
                     i++;
                 }
+                if(mp.size()==2){
+                    ans = max(ans, j-i+1);
+                }
                 j++;
             }
         }
-        if(fruits.size()==1 && fruits[0]==0) return 1;
-        else return res;
+        return ans;
     }
 };