不是大整数做法
class Solution {
public:
vector<vector<int>> threeSum(vector<int>& nums) {
vector<vector<int>> ans;
sort(nums.begin(), nums.end());
int n = nums.size();
for(int i = 0; i < n - 2; i++){
if(i > 0 && nums[i] == nums[i-1])
continue;
int j = i + 1;
int k = n - 1;
while(j < k){
int sum = nums[j] + nums[k];
if(sum == -nums[i]){
ans.push_back({nums[i], nums[j], nums[k]});
while(j < k && nums[j] == nums[j + 1]) j++;
j++;
while(j < k && nums[k] == nums[k-1]) k--;
k--;
}
else if(sum > -nums[i]) k--;
else j++;
}
}
return ans;
}
};