给定一个包含 n 个整数的数组 nums 和一个目标值 target,判断 nums 中是否存在四个元素 a,b,c 和 d ,使得 a + b + c + d 的值与 target 相等?找出所有满足条件且不重复的四元组。
注意:
答案中不可以包含重复的四元组。
示例:
给定数组 nums = [1, 0, -1, 0, -2, 2],和 target = 0。
满足要求的四元组集合为:
[
[-1, 0, 0, 1],
[-2, -1, 1, 2],
[-2, 0, 0, 2]
]
public List<List<Integer>> fourSum(int[] nums, int target) {
Arrays.sort(nums);
List<List<Integer>> list = new ArrayList<>();
Set<List<Integer>> res = fourSum(nums,0,nums.length-1,target);
for(List temp : res){
list.add(temp);
}
return list;
}
//两数之和
public static Set<List<Integer>> twoSum(int[] a, int h, int e, int target) {
Set<List<Integer>> res = new HashSet<>();
while (h < e) {
int temp = a[h] + a[e];
if (temp == target) {
List<Integer> list = new ArrayList<>();
list.add(a[h]);
list.add(a[e]);
res.add(list);
e--;
} else if (temp < target) {
h++;
} else {
e--;
}
}
return res;
}
//三数之和
public static Set<List<Integer>> threeSum(int[] a, int h, int e, int target) {
Set<List<Integer>> res = new HashSet<>();
for (int i = h; i <= e - 2; i++) {
int target_temp = target - a[i];
int two_h = i+1;
int two_e = e;
Set<List<Integer>> temp_set = twoSum(a, two_h, two_e, target_temp);
for (List list : temp_set) {
list.add(a[i]);
res.add(list);
}
}
return res;
}
//四数之和
public static Set<List<Integer>> fourSum(int[] a, int h, int e, int target) {
Set<List<Integer>> res = new HashSet<>();
for (int i = h; i <= e - 2; i++) {
int target_temp = target - a[i];
int three_h = i+1;
int three_e = e;
Set<List<Integer>> temp_set = threeSum(a, three_h, three_e, target_temp);
for (List list : temp_set) {
list.add(a[i]);
res.add(list);
}
}
return res;
}