forked from geemaple/leetcode
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy path15.3sum.cpp
More file actions
61 lines (52 loc) · 1.55 KB
/
15.3sum.cpp
File metadata and controls
61 lines (52 loc) · 1.55 KB
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
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
class Solution {
private:
void twoSum(vector<int>& nums, int start, vector<vector<int>> &res){
int left = start + 1;
int right = nums.size() - 1;
while(left < right){
int candidate = nums[start] + nums[left] + nums[right];
if (candidate > 0)
{
right -= 1;
}
else if (candidate < 0)
{
left += 1;
}
else
{
vector<int> answer;
answer.push_back(nums[start]);
answer.push_back(nums[left]);
answer.push_back(nums[right]);
res.push_back(answer);
while(left < right && nums[left + 1] == nums[left]){
left += 1;
}
while (left < right && nums[right - 1] == nums[right]) {
right -= 1;
}
left += 1;
right -= 1;
}
}
}
public:
vector<vector<int>> threeSum(vector<int>& nums) {
if (nums.size() < 3)
{
return vector<vector<int>>();
}
vector<vector<int>> res;
sort(nums.begin(), nums.end());
for (auto i = 0; i < nums.size(); ++i)
{
if (i > 0 and nums[i] == nums[i - 1])
{
continue;
}
twoSum(nums, i, res);
}
return res;
}
};