Question:
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] ]Solution:
public class Solution {
public List<List<Integer>> threeSum(int[] nums) {
// 那能不能降到O(n^2)?排序算法的时间复杂度为O(nlgn),小于O(n^2),那么我们不妨先对数组排个序。
//排序之后,我们就可以对数组用两个指针分别从前后两端向中间扫描了,如果是 2Sum,我们找到两个指针之和为target就OK了,那 3Sum //类似,我们可以先固定一个数,然后找另外两个数之和为第一个数的相反数就可以了。
List<List<Integer>> ans=new ArrayList<List<Integer>>();
int len=nums.length;
Arrays.sort(nums);
int j,k;
for(int i=0;i<=len-3;i++)
{
j=i+1;
k=len-1;
while(j<k)
{
int sum=nums[i]+nums[j]+nums[k];
if(sum==0)
{
List<Integer> tmp=new ArrayList<Integer>();
tmp.add(nums[i]);
tmp.add(nums[j]);
tmp.add(nums[k]);
ans.add(tmp);
k--;
j++;
while(j<k&&nums[j]==nums[j-1]) j++;
while(j<k&&nums[k]==nums[k+1]) k--;
}
else if(sum<0)
{
j++;
while(j<k&&nums[j]==nums[j-1]) j++; //avoid duplication
}
else if(sum>0)
{
k--;
while(j<k&&nums[k]==nums[k+1]) k--; //avoid duplication
}
}
while(i<=len-3&&nums[i]==nums[i+1])
i++;
}
return ans;
}
}