【Leetcode】4Sum

题目链接：https://leetcode.com/problems/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:

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

思路：

在3sum基础上再嵌套一层循环，时间复杂度为O(n^3)，最好的方法是O(n^2*logn)，参考网上的解法，此处就不列了

算法：

[java]  view plain  copy

 

1. List<List<Integer>> lists = new ArrayList<List<Integer>>();  
2.   
3. public List<List<Integer>> fourSum(int[] nums, int target) {  
4.     if (nums.length < 4)  
5.         return lists;  
6.     Arrays.sort(nums);  
7.     for (int i = 0; i < nums.length; i++) {  
8.         threeSum(nums, i + 1, nums[i], target);  
9.     }  
10.     return lists;  
11. }  
12.   
13. public List<List<Integer>> threeSum(int[] nums, int start, int fnum, int target) {  
14.     for (int i1 = start; i1 < nums.length; i1++) {  
15.         int i2 = i1 + 1;  
16.         int i3 = nums.length - 1;  
17.         while (i2 < i3) {  
18.             if (nums[i2] + nums[i3] + nums[i1] == target - fnum) {  
19.                 List<Integer> list = new ArrayList<Integer>();  
20.                 list.add(fnum);  
21.                 list.add(nums[i1]);  
22.                 list.add(nums[i2]);  
23.                 list.add(nums[i3]);  
24.                 if (!lists.contains(list))  
25.                     lists.add(list);  
26.                 i2++;  
27.                 i3--;  
28.             } else if (nums[i2] + nums[i3] + nums[i1] > target - fnum) {  
29.                 i3--;  
30.             } else if (nums[i2] + nums[i3] + nums[i1] < target - fnum) {  
31.                 i2++;  
32.             }  
33.         }  
34.     }  
35.     return lists;  
36. }