forked from doocs/leetcode
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathSolution.cpp
40 lines (32 loc) · 1.14 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
37
38
39
40
class Solution {
public:
vector<vector<int>> threeSum(vector<int>& nums) {
sort(nums.begin(),nums.end());
vector<vector<int>> ans;
int sum;
int len = nums.size();
int left,right;
for(int i = 0; i< len;i++){
left = i + 1;
right = len - 1;
while(left < right){
sum = nums[i] + nums[left] + nums[right];
if(sum == 0){
vector<int> vec;
vec.push_back(nums[i]);
vec.push_back(nums[left]);
vec.push_back(nums[right]);
ans.push_back(vec);
while(left < right && nums[left] == nums[left + 1])left++;
while(left < right && nums[right] == nums[right - 1])right--;
left++;
right--;
}
if(sum > 0)right--;
if(sum < 0)left++;
}
while(i<len-1 && nums[i] == nums[i+1])i++;
}
return ans;
}
};