题目:
Given an array nums
of n integers and an integer target
, are there elements a, b, c, and d in nums
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.
Example:
Given array nums = [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 FourSum {
public static List<List<Integer>> fourSum(int[] nums, int target) {
Arrays.sort(nums);
List<List<Integer>> result = new ArrayList<List<Integer>>();
for (int i=0; i<nums.length-3; i++) {
if (i>0 && nums[i] == nums[i-1]) continue;
if (nums[i] + 3 * nums[nums.length-1] < target) continue;
if (nums[i] + 3 * nums[i+1] > target) break;
for (int j=i+1; j<nums.length-2; j++) {
if (j>i+1 && nums[j] == nums[j-1]) continue;
if (nums[i] + nums[j] + 2 * nums[nums.length-1] < target) continue;
if (nums[i] + 3 * nums[j] > target) break;
int begin = j+1;
int end = nums.length-1;
while (begin < end) {
int sum = nums[i] + nums[j] + nums[begin] + nums[end];
if (sum > target) end--;
else if (sum < target) begin++;
else {
if (begin == j+1 || nums[begin] != nums[begin-1]) {
List<Integer> list = new ArrayList<>();
list.add(nums[i]);
list.add(nums[j]);
list.add(nums[begin]);
list.add(nums[end]);
result.add(list);
}
begin++;
end--;
}
}
}
}
return result;
}
public static void main(String[] args) {
int[] nums = {1, 0, -1, 0, -2, 2};
int target = 0;
fourSum(nums, target).stream().forEach(list -> System.out.println(list.toString()));
}
}