# (Java)LeetCode-18. 4Sum

Given an array S of n integers, are there elements abc, 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:

• Elements in a quadruplet (a,b,c,d) must be in non-descending order. (ie, a ≤ b ≤ c ≤ d)
• 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)

public class Solution {
public List<List<Integer>> fourSum(int[] nums, int target) {
Arrays.sort(nums);
List<List<Integer>> result = new ArrayList<List<Integer>>();
int length = nums.length;
int pre_i = Integer.MAX_VALUE;
for(int i = 0; i < length - 3; i++){
if(pre_i == nums[i]){
continue;
}
pre_i = nums[i];
if(4*nums[i] > target){
break;
}
int remain_target = target-nums[i];
if(nums[i] + 3*nums[i+1] > target || nums[i] + 3*nums[length-1] < target){
continue;
}
for(int j = i+1; j < length - 2; j++){
if(j > i+1 && nums[j-1]==nums[j]){
continue;
}
int m = j + 1;
int n = length-1;
int sub_target = target-nums[i]-nums[j];
while(m < n){
if(nums[m] + nums[n] == sub_target){
Integer[] temp = {nums[i],nums[j],nums[m],nums[n]};
while(++m < n && nums[m] == nums[m-1]);
while(m < --n && nums[n] == nums[n+1]);
}
else if(nums[m] + nums[n] < sub_target){
while(++m < n && nums[m] == nums[m-1]);
}else{
while(m < --n && nums[n] == nums[n+1]);
}
}
}
}
return result;
}
}

#### 4Sum (Java)

2015-01-04 15:51:27

#### 【LeetCode-面试算法经典-Java实现】【018-4Sum（四个数的和）】

2015-07-22 07:22:02

#### leetcode解题之 18. 4Sum Java版（结果是目标值的四个数字和）

2017-04-06 18:43:11

#### LeetCode : 4Sum [java]

2016-03-07 10:42:10

#### 4Sum Java

2014-08-10 14:44:45

#### LeetCode – 4Sum (Java)题解

2016-03-20 17:33:50

#### leetcode 18. 4Sum

2018-03-29 16:17:16

#### leetcode-Java-18. 4Sum

2016-06-03 18:18:09

#### 18. 4Sum

2016-05-08 15:21:43

#### LeetCode 18: 4Sum

2015-06-02 22:00:39