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] ]现在是需要找出4元组的了 a + b + c + d = target。思想还是跟3Sum的做法一样。注意重复的问题。
我们先确定 a = nums[ i ], b = nums[ j ] ,然后在后面的数组中,用nums[ lo ] 和 nums[ hi ]逼近我们想要的 c 和 d。
复杂度:
时间复杂度: O ( n^3 )
空间复杂度:O ( 1 )
效率:
代码:
public List<List<Integer>> fourSum(int[] nums, int target) {
Arrays.sort(nums);
List<List<Integer>> result = new ArrayList<>();
for (int i = 0; i < nums.length; i++) {
if (i > 0 && nums[i] == nums[i - 1]) {
continue;
}
for (int j = i + 1; j < nums.length; j++) {
if (j > i + 1 && nums[j] == nums[j - 1]) {
continue;
}
int lo = j + 1;
int hi = nums.length - 1;
while (lo < hi) {
if ((nums[i] + nums[j] + nums[lo] + nums[hi]) == target) {
result.add(Arrays.asList(nums[i], nums[j], nums[lo], nums[hi]));
while (lo + 1 <= hi && nums[lo + 1] == nums[lo]) {
lo++;
}
while (hi - 1 >= lo && nums[hi - 1] == nums[hi]) {
hi--;
}
lo++;
hi--;
} else if ((nums[i] + nums[j] + nums[lo] + nums[hi]) > target) {
hi--;
} else {
lo++;
}
}
}
}
return result;
}