-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path3sum.cpp
35 lines (30 loc) · 1003 Bytes
/
3sum.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
class Solution {
public:
vector<vector<int>> threeSum(vector<int>& nums) {
vector<vector<int>> res;
int n = nums.size();
sort(nums.begin(), nums.end());
for (int i = 0; i < n - 2; i++) {
if (i > 0 && nums[i] == nums[i - 1]) continue;
int target = -nums[i];
int j = i + 1, k = n - 1;
while (j < k) {
int sum = nums[j] + nums[k];
if (sum == target) {
res.push_back({nums[i], nums[j], nums[k]});
j++;
k--;
while (j < k && nums[j] == nums[j - 1]) j++;
while (j < k && nums[k] == nums[k + 1]) k--;
}
else if (sum < target) {
j++;
}
else {
k--;
}
}
}
return res;
}
};