Solution to Problem No. 1755

solution/1700-1799/1755.Closest Subsequence Sum/README.md

@@ -59,7 +59,38 @@
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```python
+class Solution:
+    def minAbsDifference(self, nums: List[int], goal: int) -> int:
+        n = len(nums)
+        left = set()
+        right = set()
 
+        self.getSubSeqSum(0, 0, nums[:n // 2], left)
+        self.getSubSeqSum(0, 0, nums[n // 2:], right)
+
+        result = float('inf')
+        right = sorted(right)
+        rl = len(right)
+
+        for l in left:
+            remaining = goal - l
+            idx = bisect_left(right, remaining)
+
+            if idx < rl:
+                result = min(result, abs(remaining - right[idx]))
+
+            if idx > 0:
+                result = min(result, abs(remaining - right[idx - 1]))
+
+        return result
+
+    def getSubSeqSum(self, i: int, curr: int, arr: List[int], result: Set[int]):
+        if i == len(arr):
+            result.add(curr)
+            return
+
+        self.getSubSeqSum(i + 1, curr, arr, result)
+        self.getSubSeqSum(i + 1, curr + arr[i], arr, result)
 ```
 
 ### **Java**

solution/1700-1799/1755.Closest Subsequence Sum/README_EN.md

@@ -54,7 +54,38 @@ The absolute difference is abs(-4 - (-5)) = abs(1) = 1, which is the minimum.
 ### **Python3**
 
 ```python
+class Solution:
+    def minAbsDifference(self, nums: List[int], goal: int) -> int:
+        n = len(nums)
+        left = set()
+        right = set()
 
+        self.getSubSeqSum(0, 0, nums[:n // 2], left)
+        self.getSubSeqSum(0, 0, nums[n // 2:], right)
+
+        result = float('inf')
+        right = sorted(right)
+        rl = len(right)
+
+        for l in left:
+            remaining = goal - l
+            idx = bisect_left(right, remaining)
+
+            if idx < rl:
+                result = min(result, abs(remaining - right[idx]))
+
+            if idx > 0:
+                result = min(result, abs(remaining - right[idx - 1]))
+
+        return result
+
+    def getSubSeqSum(self, i: int, curr: int, arr: List[int], result: Set[int]):
+        if i == len(arr):
+            result.add(curr)
+            return
+
+        self.getSubSeqSum(i + 1, curr, arr, result)
+        self.getSubSeqSum(i + 1, curr + arr[i], arr, result)
 ```
 
 ### **Java**

solution/1700-1799/1755.Closest Subsequence Sum/Solution.py

@@ -0,0 +1,32 @@
+class Solution:
+    def minAbsDifference(self, nums: List[int], goal: int) -> int:
+        n = len(nums)
+        left = set()
+        right = set()
+
+        self.getSubSeqSum(0, 0, nums[:n // 2], left)
+        self.getSubSeqSum(0, 0, nums[n // 2:], right)
+
+        result = float('inf')
+        right = sorted(right)
+        rl = len(right)
+
+        for l in left:
+            remaining = goal - l
+            idx = bisect_left(right, remaining)
+
+            if idx < rl:
+                result = min(result, abs(remaining - right[idx]))
+
+            if idx > 0:
+                result = min(result, abs(remaining - right[idx - 1]))
+
+        return result
+
+    def getSubSeqSum(self, i: int, curr: int, arr: List[int], result: Set[int]):
+        if i == len(arr):
+            result.add(curr)
+            return
+
+        self.getSubSeqSum(i + 1, curr, arr, result)
+        self.getSubSeqSum(i + 1, curr + arr[i], arr, result)