Given an array S of n integers, are there elements a, b, c in S such that a + b + c = 0? Find all unique triplets in the array which gives the sum of zero.
Note:
- Elements in a triplet (a,b,c) must be in non-descending order. (ie, a ≤ b ≤ c)
- The solution set must not contain duplicate triplets.
For example, given array S = {-1 0 1 2 -1 -4}, A solution set is: (-1, 0, 1) (-1, -1, 2)Array Two Pointers
Solution in C++1: //循环的方法,两个指针从两端往中间移动
class Solution {
public:
vector<vector<int>> threeSum(vector<int>& nums) {
vector<vector<int>> result;
if(nums.size()<3) return result;
sort(nums.begin(), nums.end());
for(int i=0; i<nums.size()-2; i++){
if(i>0&&nums[i]==nums[i-1]) continue;
int start = i+1, end = nums.size()-1;
while(start<end){
int sum = nums[i] + nums[start] + nums[end];
if(sum>0) end--;
else if(sum<0) start++;
else{
vector<int> curRes;
curRes.push_back(nums[i]);
curRes.push_back(nums[start]);
curRes.push_back(nums[end]);
result.push_back(curRes);
start++;
end--;
while(nums[start]==nums[start-1]&&start<end) start++;
while(nums[end]==nums[end+1]&&start<end) end--;
}
}
}
return result;
}
};
Note:1. 要想用这个方法,必须先排序
<span style="white-space:pre"> </span>2. if(i>0&&nums[i]==nums[i-1]) continue; 这句必须是i>0的情况检查i和i-1,不然输入是[0,0,0]时会出错。
<span style="white-space:pre"> </span>3. 因为题中要求不能出现duplicate的三个,所以要做是否重复的检查。而这个检查一定要放在sum==0的else分支里
<span style="white-space:pre"> </span> 因为在这里i,start和end所对应的值已被检查过,如果合法且已加入result中,则剩下的值相同的三人组才可以
<span style="white-space:pre"> </span> 跳过不检查。