题目链接:https://leetcode.com/problems/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:
- 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)
思路:
先排序,依次选定每个元素a,看剩下任意两元素和a的和是否为0,这里选择剩下元素中的任意两元素的时候要注意从头部和尾部各选一个,下次选择的时候往中间移动,这样选择两元素的时间复杂度就是O(n),而不是两层循环式的选择。 算法时间复杂度为O(n^2)。
还有个难点在消除重复解,如果用集合自带的方法判断list重复,则会超时。
算法:
public List<List<Integer>> threeSum(int[] nums) {
Arrays.sort(nums);
List<List<Integer>> lists = new ArrayList<List<Integer>>();
for (int i1 = 0; i1 < nums.length; i1++) {
int i2 = i1 + 1;
int i3 = nums.length - 1;
while (i2 < i3) {
if (nums[i2] + nums[i3] == -nums[i1]) {
List<Integer> list = new ArrayList<Integer>();
list.add(nums[i1]);
list.add(nums[i2]);
list.add(nums[i3]);
if (!lists.contains(list))
lists.add(list);
i2++;
i3--;
} else if (nums[i2] + nums[i3] > -nums[i1]) {
i3--;
} else if (nums[i2] + nums[i3] < -nums[i1]) {
i2++;
}
}
}
return lists;
}