Update 2106.Maximum-Fruits-Harvested-After-at-Most-K-Steps_v1.cpp

wisdompeak · web-flow · commit fd4206c83e11 · 2021-12-19T23:45:35.000-08:00
diff --git a/Binary_Search/2106.Maximum-Fruits-Harvested-After-at-Most-K-Steps/2106.Maximum-Fruits-Harvested-After-at-Most-K-Steps_v1.cpp b/Binary_Search/2106.Maximum-Fruits-Harvested-After-at-Most-K-Steps/2106.Maximum-Fruits-Harvested-After-at-Most-K-Steps_v1.cpp
@@ -12,17 +12,8 @@ class Solution {
         }
         
         int ret = 0;
-        int mid = upper_bound(pos.begin(), pos.end(), startPos) - pos.begin();
-        int j = n-1;
-        for (int i=mid-1; i>=0; i--)
-        {            
-            while (pos[j]>=startPos && startPos-pos[i]+(pos[j]-startPos)*2 > k)
-                j--;            
-            if (pos[j]>=startPos) ret = max(ret, presum[j] - (i==0?0:presum[i-1]));
-            else if (startPos-pos[i] <= k) ret = max(ret, presum[j] - (i==0?0:presum[i-1]));
-        }
         
-        mid = lower_bound(pos.begin(), pos.end(), startPos) - pos.begin();
+        int mid = lower_bound(pos.begin(), pos.end(), startPos) - pos.begin();
         j = 0;        
         for (int i=mid; i<n; i++)
         {
@@ -31,6 +22,18 @@ class Solution {
             if (pos[j]<=startPos) ret = max(ret, presum[i] - (j==0?0:presum[j-1]));
             else if (pos[i]-startPos <= k) ret = max(ret, presum[i] - (j==0?0:presum[j-1]));
         }
+        
+        mid = upper_bound(pos.begin(), pos.end(), startPos) - pos.begin();        
+        int j = n-1;
+        for (int i=mid-1; i>=0; i--)
+        {            
+            while (pos[j]>=startPos && startPos-pos[i]+(pos[j]-startPos)*2 > k)
+                j--;            
+            if (pos[j]>=startPos) ret = max(ret, presum[j] - (i==0?0:presum[i-1]));
+            else if (startPos-pos[i] <= k) ret = max(ret, presum[j] - (i==0?0:presum[i-1]));
+        }
+        
+        
 
         return ret;
     }
