问题链接:https://oj.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)
API:public List<List<Integer>> threeSum(int[] num)
说白了,3sum, 3sum closest, 乃至4 sum都是基于2 sum的做法延伸了一下而已。因为题目要求返回的并不是index,而是实实在在的数值。所以这里我就采取了先排序的做法。
2 sum之前给过一个HashMap的做法,当时的算法复杂度是O(n),2 sum实际上还有一个先排序然后前后往中间夹逼的方法,不占用空间,但复杂度为O(nlogn),复杂度的提升来自于排序。但在3sum里,先排序的做法并不会影响复杂度,因为不管是用HashMap还是排序夹逼法,都需要至少两重循环。所以复杂度为O(n^2)是跑不掉的,排序也不会增加复杂度上限。而且排序后可以更好地处理去重复的问题。下面给出具体代码:
public List<List<Integer>> threeSum(int[] num) {
Arrays.sort(num);
List<List<Integer>> res = new LinkedList<List<Integer>>();
for(int i = 0; i < num.length; i++){
if(i > 0 && num[i] == num[i - 1])
continue;
int head = i + 1;
int tail = num.length - 1;
while(head < tail){
if(head != i + 1 && num[head] == num[head - 1]){
head++;
continue;
}
if(tail != num.length - 1 && num[tail] == num[tail + 1]){
tail--;
continue;
}
if(num[i] + num[head] + num[tail] > 0){
tail--;
}else if(num[i] + num[head] + num[tail] < 0){
head++;
}else{
LinkedList<Integer> cur_res = new LinkedList<Integer>();
cur_res.add(num[i]);
cur_res.add(num[head]);
cur_res.add(num[tail]);
head++;
tail--;
res.add(cur_res);
}
}
}
return res;
}