双指针
class Solution {
public:
vector<vector<int>> threeSum(vector<int>& nums) {
vector<vector<int>>ans;
sort(nums.begin(),nums.end());
for(int i=0;i<nums.size();i++){
if(i && nums[i]==nums[i-1])continue; //去重
for(int j=i+1,k=nums.size()-1;j<k;j++){
if(j>i+1 && nums[j]==nums[j-1])continue; //去重
while(k-1>j && nums[i]+nums[j]+nums[k-1]>=0)k--; //找到最小的k,使得三个数之和大于等于0
if(nums[i]+nums[j]+nums[k]==0){
ans.push_back({nums[i],nums[j],nums[k]});
}
}
}
return ans;
}
};
//排序
//双指针