Update 1755.Closest-Subsequence-Sum.cpp

wisdompeak · web-flow · commit b172d3c1bb1b · 2021-02-08T22:04:55.000-08:00
diff --git a/Bit_Manipulation/1755.Closest-Subsequence-Sum/1755.Closest-Subsequence-Sum.cpp b/Bit_Manipulation/1755.Closest-Subsequence-Sum/1755.Closest-Subsequence-Sum.cpp
@@ -1,4 +1,5 @@
 class Solution {
+    int ret = INT_MAX;
 public:
     int minAbsDifference(vector<int>& nums, int goal) 
     {
@@ -9,24 +10,9 @@ class Solution {
 
         vector<int>a = getSubSetsSum(nums1);
         vector<int>b = getSubSetsSum(nums2);
-
-        int ret = INT_MAX;
-        for (auto x: a)
-        {
-            auto iter = lower_bound(b.begin(), b.end(), goal-x);
-            if (iter!=b.end())
-                ret = min(ret, abs(goal-x - *iter));
-            if (iter!=b.begin())
-                ret = min(ret, abs(goal-x - *prev(iter)));
-        }
-        for (auto x: b)
-        {
-            auto iter = lower_bound(a.begin(), a.end(), goal-x);
-            if (iter!=a.end())
-                ret = min(ret, abs(goal-x - *iter));
-            if (iter!=a.begin())
-                ret = min(ret, abs(goal-x - *prev(iter)));
-        }
+        
+        findAns(a,b,goal);
+        findAns(b,a,goal);
         return ret;
     }
 
@@ -82,4 +68,16 @@ class Solution {
         }
         return sums;
     }
+
+    void findAns(vector<int>&a, vector<int>&b, int goal)
+    {
+        for (auto x: a)
+        {
+            auto iter = lower_bound(b.begin(), b.end(), goal-x);
+            if (iter!=b.end())
+                ret = min(ret, abs(goal-x - *iter));
+            if (iter!=b.begin())
+                ret = min(ret, abs(goal-x - *prev(iter)));
+        }
+    }
 };
