题目描述
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]
]
思路分析
求和为定值的四个数之和,可以先确定一个数,然后就转化为求3个数和为定值。对于三个数之和为定值的求解,上面已经分析过,即转化为两个数之和为定值的求解。
代码
package com.jie.sum;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.List;
public class FourSumSolution {
public static void main(String[] args) {
int[] nums = {1,0,-1,0,-2,2};
List<List<Integer>> res = new ArrayList<>();
res = fourSum(nums,0);
for (List<Integer> list : res) {
System.out.print("[");
for (Integer integer : list) {
System.out.print(integer+",");
}
System.out.println("]");
}
}
public static List<List<Integer>> fourSum(int[] nums, int target) {
List<List<Integer>> res = new ArrayList<List<Integer>>();
if(nums.length<4)
return res;
Arrays.sort(nums);
return kSum(nums, target, 4, 0);
}
private static ArrayList<List<Integer>> kSum(int[] nums, int target, int k, int index) {
int len = nums.length;
ArrayList<List<Integer>> res = new ArrayList<List<Integer>>();
if(index >= len) {
return res;
}
//两个数之和为定值
if(k == 2) {
int i = index, j = len - 1;
while(i < j) {
if(target - nums[i] == nums[j]) {
List<Integer> temp = new ArrayList<>();
temp.add(nums[i]);
temp.add(target-nums[i]);
res.add(temp);
//跳过重复的数值
while(i<j && nums[i]==nums[i+1]) i++;
while(i<j && nums[j-1]==nums[j]) j--;
i++;
j--;
} else if (target - nums[i] > nums[j]) {
i++;
} else {
j--;
}
}
} else{
for (int i = index; i < len - k + 1; i++) {
//把kSum转化为k-1Sum
ArrayList<List<Integer>> temp = kSum(nums, target - nums[i], k-1, i+1);
if(temp != null){
for (List<Integer> t : temp) {
t.add(0, nums[i]);
}
res.addAll(temp);
}
//跳过重复的数值
while (i < len-1 && nums[i] == nums[i+1]) {
i++;
}
}
}
return res;
}
}