forked from wisdompeak/LeetCode
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path15-3Sum.cpp
46 lines (37 loc) · 1.28 KB
/
15-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
36
37
38
39
40
41
42
43
44
45
46
class Solution {
public:
vector<vector<int>> threeSum(vector<int>& nums)
{
sort(nums.begin(), nums.end());
vector<vector<int>>result;
for (int i=0; i<nums.size(); i++)
cout<<nums[i]<<" ";
cout<<endl;
for (int a=0; a<nums.size(); a++)
{
int sum=-nums[a];
int left=a+1;
int right=nums.size()-1;
while (left<right)
{
if (nums[left]+nums[right]==sum)
{
vector<int>temp{nums[a],nums[left],nums[right]};
result.push_back(temp);
left++;
right--;
while (left<right && nums[left]==nums[left-1]) left++;
while (left<right && nums[right]==nums[right+1]) right--;
}
else if (nums[left]+nums[right]<sum)
left++;
else if (nums[left]+nums[right]>sum)
right--;
// cout<<a<<" "<<left<<" "<<right<<endl;
}
while (a+1<nums.size() && nums[a]==nums[a+1])
a++;
}
return result;
}
};