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)
public class Solution {
public List<List<Integer>> fourSum(int[] num, int target) {ArrayList<List<Integer>> result=new ArrayList<List<Integer>>();
if(num.length<4)return result;
Arrays.sort(num);
int len= num.length;
for(int i=0;i<len-2;i++){
for(int j=len-1;j>i;j--){
int sum1=target-num[i]-num[j];
/*eliminate some cases*/
// while(j>1&&i<len-1&&sum1<2*num[i+1]){j--;sum1=target-num[i]-num[j];}
//while(i<len-1&&j>1&&sum1>2*num[j-1]){i++;sum1=target-num[i]-num[j];}
int start=i+1,end=j-1;
while(start<end){
if(num[start]+num[end]==sum1){
/*add the four element in the list*/
result.add(Arrays.asList(num[i],num[start],num[end],num[j]));
/*remove duplicate*/
start++;
end--;
while(start<len-1&&num[start]==num[start-1])start++;
while(end>1&&num[end]==num[end+1])end--;
}
else if(num[start]+num[end]>sum1){
end--;
while(end>i+1&&num[end]==num[end+1])end--;
}
else{
start++;
while(start<j-1&&num[start]==num[start-1])start++;
}
}
while(j>1&&num[j]==num[j-1])j--;
}
while(i<len-1&&num[i]==num[i+1])i++;
}
return result;
}
}