给你一个包含 n 个整数的数组 nums,判断 nums 中是否存在三个元素 a,b,c ,使得 a + b + c = 0 ?请你找出所有和为 0 且不重复的三元组。
注意:答案中不可以包含重复的三元组。
class Solution {
public:
vector<vector<int>> threeSum(vector<int>& nums) {
sort(nums.begin(), nums.end());
int N = nums.size();
vector<vector<int>> res;
for (int first=0; first<N; ++ first) {
if (first>0 && nums[first]==nums[first-1]) {
continue;
}
int target = -nums[first];
int third = N-1;
for (int second=first+1; second<N; ++second) {
if (second>first+1 && nums[second]==nums[second-1]) continue;
while (second<third && nums[third]+nums[second]>target) {
third --;
}
if (second==third) {
break;
}
if (nums[second]+nums[third]==target) {
res.push_back({nums[first], nums[second], nums[third]});
}
}
}
return res;
}
};