Update 1438.Longest-Continuous-Subarray-With-Absolute-Diff-Less-Than-or-Equal-to-Limit_heap.cpp

wisdompeak · web-flow · commit 266d6ee8f033 · 2020-05-10T00:40:11.000-07:00
diff --git a/Deque/1438.Longest-Continuous-Subarray-With-Absolute-Diff-Less-Than-or-Equal-to-Limit/1438.Longest-Continuous-Subarray-With-Absolute-Diff-Less-Than-or-Equal-to-Limit_heap.cpp b/Deque/1438.Longest-Continuous-Subarray-With-Absolute-Diff-Less-Than-or-Equal-to-Limit/1438.Longest-Continuous-Subarray-With-Absolute-Diff-Less-Than-or-Equal-to-Limit_heap.cpp
@@ -2,31 +2,25 @@ class Solution {
 public:
     int longestSubarray(vector<int>& nums, int limit) 
     {
-        multiset<int>Set;
+        multiset<int>Set({nums[0]});
         int j = 0;
         int ret = 0;        
         
         for (int i=0; i<nums.size(); i++)
         {            
-            while (j<nums.size() && (Set.size()==0 || *Set.rbegin()-*Set.begin()<=limit))
+            while (*Set.rbegin()-*Set.begin()<=limit)
             {
-                Set.insert(nums[j]);
+                ret = max(ret, j-i+1);
                 j++;
+                if (j>=nums.size()) break;
+                Set.insert(nums[j]);
             }
-            
-            if (*Set.rbegin()-*Set.begin()>limit) 
-            {
-                j--;
-                Set.erase(Set.find(nums[j]));
-            }
-
-            ret = max(ret, (int)Set.size());
-                                    
-            if (i>=0) Set.erase(Set.find(nums[i]));     
 
+            if (j>=nums.size()) break;
+            
+            Set.erase(Set.find(nums[i]));     
         }
         
         return ret;
-        
     }
 };
