package TwoSum;

import org.junit.Test;

import java.util.List;

/**

* @description: 描述 Medium

* @author: dekai.kong (dekai.kong@luckincoffee.com)

* @date: 2018-11-06 17:13

* @from https://leetcode.com/problems/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]

]

*/

public class FourSum {

public FourSum(){

}

public List<List<Integer>> fourSum(int[] nums, int target) {

//TODO

//https://leetcode.com/problems/4sum/discuss/8609/My-solution-generalized-for-kSums-in-JAVA

return null;

}

@Test

public void testThreeSum(){

}

}