-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathLeetcode第15题.cpp
More file actions
32 lines (32 loc) · 1001 Bytes
/
Leetcode第15题.cpp
File metadata and controls
32 lines (32 loc) · 1001 Bytes
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
class Solution {
public:
vector<vector<int>> threeSum(vector<int>& nums) {
vector<vector<int>>ans;
int size=nums.size();
sort(nums.begin(),nums.end());
for(int i=0;i<size;++i){
if(nums[i]>0){
return ans;
}
if(i>0&&nums[i]==nums[i-1]){continue;}
int left=i+1;
int right=size-1;
while(left<right){
if(nums[i]+nums[left]+nums[right]>0){
right--;
}
else if(nums[i]+nums[left]+nums[right]<0){
left++;
}
else{
ans.push_back(vector<int>{nums[i],nums[left],nums[right]});
while(left<right&&nums[right]==nums[right-1]){right--;}
while(left<right&&nums[left]==nums[left+1]){left++;}
left++;
right--;
}
}
}
return ans;
}
};