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)
找出给定数组中总和为0的所有不重复的三个数的集合。
这个题目的解题思路和第一题Two Sum类似,不过给定数组中有重复的数字,在解题时要注意这点,不要输出相同的解。
使用双指针法的前提是给定数组已经排好顺序,所以首先得先给数组排序,在解题过程中也可以根据一些条件进行限界,下面是解题思路的java实现:
public class Solution {
public List<List<Integer>> threeSum(int[] nums) {
Arrays.sort(nums);
List<List<Integer>> res = new ArrayList<List<Integer>>();
for(int i = 0; i < nums.length-2 && nums[i] <= 0 ; i++){
if(i != 0 && nums[i-1] == nums[i])
continue;
for(int j = i + 1,p = nums.length-1 ; j < p ; ){
List<Integer> tmp = new ArrayList<Integer>();
if(nums[i] + nums[j] + nums[p] == 0 ){
if(j != i+1 && nums[j-1] == nums[j]){
j ++;
continue;
}
tmp.add(nums[i]);
tmp.add(nums[j]);
tmp.add(nums[p]);
res.add(tmp);
j ++ ;
}
else if(nums[i] + nums[j] + nums[p] > 0){
p --;
}
else{
j ++;
}
}
}
return res;
}
}