Update closest-subsequence-sum.cpp

kamyu104 · web-flow · commit f9337c0a3d45 · 2021-04-18T21:39:47.000+08:00
diff --git a/C++/closest-subsequence-sum.cpp b/C++/closest-subsequence-sum.cpp
@@ -28,7 +28,7 @@ class Solution {
                 result = min(result, abs(goal - x - nums[i]));  // case of right half part is 0
             }
         }
-        vector<int> sorted_sums1(cbegin(sums1), cend(sums1));  // Size: O(2^(n/2))
+        vector<int> sorted_sums1(cbegin(sums1), cend(sums1));  // Space: O(2^(n/2))
         sort(begin(sorted_sums1), end(sorted_sums1));  // Time: O((n/2) * 2^(n/2)) = O(n * 2^(n/2))
         unordered_set<int> sums2{0};
         for (int i = size(nums) / 2; i < size(nums); ++i) {  // O(n) times

Original file line number	Diff line number	Diff line change
`@@ -28,7 +28,7 @@ class Solution {`
`28`	`28`	`result = min(result, abs(goal - x - nums[i])); // case of right half part is 0`
`29`	`29`	`}`
`30`	`30`	`}`
`31`		`- vector<int> sorted_sums1(cbegin(sums1), cend(sums1)); // Size: O(2^(n/2))`
	`31`	`+ vector<int> sorted_sums1(cbegin(sums1), cend(sums1)); // Space: O(2^(n/2))`
`32`	`32`	`sort(begin(sorted_sums1), end(sorted_sums1)); // Time: O((n/2) * 2^(n/2)) = O(n * 2^(n/2))`
`33`	`33`	`unordered_set<int> sums2{0};`
`34`	`34`	`for (int i = size(nums) / 2; i < size(nums); ++i) { // O(n) times`