4Sum
题目
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个数,使它们的和等于target。
思路
先将数组排序,然后固定两个数,其它两个数逐渐向中间靠拢,寻找4个数的和为target。和3Sum方法相似。
AC代码
public class Solution {
public List<List<Integer>> fourSum(int[] nums, int target){
List<List<Integer>> result = new ArrayList<>();
if(nums == null || nums.length<4){
return result;
}
Arrays.sort(nums);
for(int i = 0; i < nums.length - 3; i++){
if(i > 0 && nums[i] == nums[i-1] ){
continue;
}
for(int j = i+1; j < nums.length - 2; j++){
if(j > i+1 && nums[j] == nums[j-1]) continue;
int m = j + 1;
int k = nums.length-1;
while(m < k){
if(nums[i] + nums[j] + nums[m] + nums[k] == target){
List<Integer> list = new ArrayList<>();
list.add(nums[i]);
list.add(nums[j]);
list.add(nums[m]);
list.add(nums[k]);
result.add(list);
++m;
--k;
while(m < k && nums[m] == nums[m-1]){
m++;
}
while(m < k && nums[k] == nums[k+1]){
--k;
}
}else{
if(nums[i] + nums[j] + nums[m] + nums[k] < target){
++m;
while(m < k && nums[m] == nums[m-1]){
m++;
}
}
if(nums[i] + nums[j] + nums[m] + nums[k] > target){
--k;
while(m < k && nums[k] == nums[k+1]){
--k;
}
}
}
}
}
}
return result;
}
}