一、问题描述
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)
二、问题分析
从题目给的Note中可以发现,需要对数组进行排序。接下来就是对数组进行遍历,因为有a+b+c=0,所以需要先选取a,然后再选择b和c,因为已经排过序,所以采用双指针的方式,在剩下的数组中一左一右选择b和c。这是a+b+c可能会大于、小于或者等于0,需要对b或者c进行调整位置。
三、Java AC 代码
public List<List<Integer>> threeSum(int[] nums) {
List<List<Integer>> list = new ArrayList<List<Integer>>();
if (nums == null || nums.length < 3) {
return list;
}
Arrays.sort(nums);
for (int i = 0; i < nums.length-2; i++) {
if (i==0 || nums[i]!=nums[i-1]) { //remove duplicate
int start = i+1;
int end = nums.length-1;
while(start < end){
int target = nums[i] + nums[start] + nums[end];
if (target==0) {
list.add(Arrays.asList(nums[i], nums[start], nums[end]));
while(start<end && nums[start++]==nums[start]);
while(start<end && nums[end--]==nums[end]);
}else if (target>0) {
end--;
}else {
start++;
}
}
}
}
return list;
}