-
Notifications
You must be signed in to change notification settings - Fork 8
/
Copy pathsolution.cpp
36 lines (35 loc) · 1.19 KB
/
solution.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
/**
* 289 / 289 test cases passed.
* Runtime: 92 ms
* Memory Usage: 12.8 MB
*/
class Solution {
public:
vector<vector<int>> fourSum(vector<int>& nums, int target) {
vector<vector<int>> ans;
int n = nums.size();
if (n < 4) return ans;
sort(nums.begin(), nums.end());
for (int i = 0; i <= n - 4; ++ i) {
if (i > 0 && nums[i] == nums[i - 1]) continue;
for (int j = i + 1; j <= n - 3; ++ j) {
if (j > i + 1 && nums[j] == nums[j - 1]) continue;
int l = j + 1, r = n - 1;
while (l < r) {
if (nums[i] + nums[j] < target - nums[l] - nums[r]) {
++ l;
} else if (nums[i] + nums[j] > target - nums[l] - nums[r]) {
-- r;
} else {
ans.push_back({nums[i], nums[j], nums[l], nums[r]});
while (l < r && nums[l] == nums[l + 1]) ++ l;
while (l < r && nums[r] == nums[r - 1]) -- r;
++ l;
-- r;
}
}
}
}
return ans;
}
};