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: 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] ]
和之前的2Sum,3Sum没什么区别,固定一个,后面的转换成3Sum.
public class A15_3Sum {
public List<List<Integer>> threeSum(int[] nums) {
Arrays.sort(nums);
List<List<Integer>> ans = new ArrayList<List<Integer>>();
for(int i = 0; i < nums.length - 2; i++) {
if(nums[i] > 0) break;
int second = i + 1;
int third = nums.length - 1;
while(second < third) {
List<Integer> list3 = new ArrayList<Integer>();
int sum = nums[i] + nums[second] + nums[third];
if(sum == 0) {
list3.add(nums[i]);
list3.add(nums[second]);
list3.add(nums[third]);
ans.add(list3);
do {
second++;
} while(second < third && nums[second - 1] == nums[second]);
do {
third--;
} while(second < third && nums[third + 1] == nums[third]);
} else if(sum > 0) {
do {
third--;
} while(second < third && nums[third + 1] == nums[third]);
} else {
do {
second++;
} while(second < third && nums[second - 1] == nums[second]);
}
}
while(i < nums.length - 2 && nums[i] == nums[i + 1])
i++;
}
return ans;
}
}
看了网上的用Hash存,两两之和为K,转换成2Sum.不过数据量又增加为n^2,感觉没有提升.