问题链接:https://oj.leetcode.com/problems/4sum/
问题描述:
Given an array S of n integers, are there elements a, b, c, and d in S such that a + b + c + d = target? Find all unique quadruplets in the array which gives the sum of target.
Note:
Elements in a quadruplet (a,b,c,d) must be in non-descending order. (ie, a ≤ b ≤ c ≤ d)
The solution set must not contain duplicate quadruplets.
For example, given array S = {1 0 -1 0 -2 2}, and target = 0.
A solution set is:
(-1, 0, 0, 1)
(-2, -1, 1, 2)
(-2, 0, 0, 2)
API:public List<List<Integer>> fourSum(int[] num, int target)
分析:这题其实就是3sum在外面多加一个循环,注意一下去重复的部分就好。代码如下:
public List<List<Integer>> fourSum(int[] num, int target) {
Arrays.sort(num);
List<List<Integer>> final_res = new LinkedList<List<Integer>>();
for(int i = 0; i < num.length; i++){
if(i != 0 && num[i] == num[i - 1])//去重复部分1
continue;
for(int j = i + 1; j < num.length; j++){
if(j != i + 1 && num[j] == num[j - 1])//去重复部分2
continue;
int head = j + 1;
int tail = num.length - 1;
while(head < tail){
if(head != j + 1 && num[head] == num[head - 1]){//和下面那个else if同为去重复部分3.
head++;
}else if(tail != num.length - 1 && num[tail] == num[tail + 1]){
tail--;
}else{
if(num[i] + num[j] + num[head] + num[tail] < target)
head++;
else if(num[i] + num[j] + num[head] + num[tail] > target)
tail--;
else{
LinkedList<Integer> res = new LinkedList<Integer>();
res.add(num[i]);
res.add(num[j]);
res.add(num[head]);
res.add(num[tail]);
final_res.add(res);
head++;
}
}
}
}
}
return final_res;
}
此算法的复杂度是O(n^3),网上有传说复杂度为O(n^2 * logn)的算法,但目前还没有想到。有知道的人可以联系我噢。囧