3Sum

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: 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]
]

这个题目是给我们一个数组，然后我们从中选出三个数字其和为0，这个题的最大问题就是容易有重复的组合，但是这个问题不需要我们返回和下标有关的东西，所以我们可以对数组进行排序，解法如下：


vector<vector<int>> threeSum(vector<int>& nums) {
vector<vector<int>> result;
sort(nums.begin(), nums.end());
for(int i=0;i<nums.size();i++)
{
int target = -nums[i];
int front = i+1;
int back = nums.size()-1;
while(front<back)
{
if(nums[front]+nums[back]<target)
{
front++;
}
else if(nums[front]+nums[back]>target)
{
back--;
}
else
{
vector<int> triplet;
triplet.push_back(nums[i]);
triplet.push_back(nums[front]);
triplet.push_back(nums[back]);
result.push_back(triplet);
while(front<back && nums[front]==triplet[1])
{
front++;
}
while(front<back && nums[back]==triplet[2])
{
back--;
}
}
}
while(i+1<nums.size()&&nums[i+1]==-target)
{
i++;
}
}
return result;
}