Description
Given an array nums of n integers, are there elements a, b, c in nums such that a + b + c = 0? Find all unique triplets in the array which gives the sum of zero.
Note
The solution set must not contain duplicate triplets.
Example
Given array nums = [-1, 0, 1, 2, -1, -4],
A solution set is:
[
[-1, 0, 1],
[-1, -1, 2]
]
Solution 1(C++)
class Solution {
public:
vector<vector<int>> threeSum(vector<int>& nums) {
sort(nums.begin(), nums.end());
vector<vector<int>> res;
for(int i=0; i<nums.size(); i++){
if(i>0 && nums[i]==nums[i-1]) continue;
int l=i+1, r=nums.size()-1;
while(l<r){
int sum=nums[i]+nums[l]+nums[r];
if(sum>0) r--;
else if(sum<0) l++;
else{
res.push_back(vector<int>{nums[i], nums[l], nums[r]});
while(nums[l]==nums[l+1]) l++;
while(nums[r]==nums[r-1]) r--;
l++; r--;
}
}
}
return res;
}
};
算法分析
双指针法,题目不难,注意细节:不能有重复的数组出现在答案中。这道题有很多变形。需要系统的整理。
程序分析
注意直接用元素显性构造一个vector:
res.push_back(vector<int>{nums[i], nums[l], num[r]});