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且每组三个数不可重复。可以先把序列排序,第一个数采用for循环,第二个数从i+1开始向后遍历,第三个数从length-1开始向前遍历。如果大于0或者小于0,移动第二个数或第三个数其中一个,如果等于0,第二个和第三个数都往中间移动。算法复杂度O(n),代码如下:
public class Solution {
public List<List<Integer>> threeSum(int[] nums) {
Arrays.sort(nums);
List<List<Integer>> result = new ArrayList<List<Integer>>();
for (int i = 0; i < nums.length - 2; i++) {
if (i == 0 || (i > 0 && nums[i] != nums[i - 1])) {
int low = i + 1, high = nums.length - 1, sum = 0 - nums[i];
while (low < high){
if (nums[low] + nums[high] == sum) {
/*List<Integer> temp = new ArrayList<Integer>();
temp.add(nums[i]);
temp.add(nums[low]);
temp.add(nums[high]);
result.add(temp);*/
result.add(Arrays.asList(nums[i], nums[low], nums[high]));
low ++;
high --;
while (low < high && nums[low] == nums[low - 1]) low ++;
while (low < high && nums[high] == nums[high + 1]) high --;
}else if (nums[low] + nums[high] > sum) {
high --;
} else {
low ++;
}
}
}
}
return result;
}
}