# LeetCode 18. 4Sum

### 问题描述

• 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]
]

### 经验教训

• 由 2Sum, 3Sum, 4Sum 推导出 k Sum

### 代码实现

    public List<List<Integer>> fourSum(int[] nums, int target) {
if (nums == null || nums.length == 0) {
return new ArrayList<>();
}
Arrays.sort(nums);
List<List<Integer>> res = new ArrayList<List<Integer>>();
for (int i = 0; i < nums.length ; i++) {
if (i != 0 && nums[i] == nums[i - 1]) {
continue;
}
for (int j = i + 1; j < nums.length ; j++) {
if (j != i + 1 && nums[j] == nums[j - 1]) {
continue;
}
int left = j + 1;
int right = nums.length - 1;
int sum = target - nums[i] - nums[j];
while (left < right) {
if (nums[left] + nums[right] == sum) {
ArrayList<Integer> list = new ArrayList<>();
while (left < right && nums[left] == nums[left - 1]) {
++left;
}
while (left < right && nums[right] == nums[right + 1]) {
--right;
}
}else if (nums[left] + nums[right] < sum) {
++left;
}else {
--right;
}
}
}
}
return res;
}

• 广告
• 抄袭
• 版权
• 政治
• 色情
• 无意义
• 其他

120