LeetCode-Solution/src/_018/Solution.java at master · RichCodersAndMe/LeetCode-Solution · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
package _018;

import java.util.*;

/**
 * <pre>
 *     author: Blankj
 *     blog  : http://blankj.com
 *     time  : 2018/01/30
 *     desc  :
 * </pre>
 */
public class Solution {
//    public List<List<Integer>> fourSum(int[] nums, int target) {
//        List<List<Integer>> res = new ArrayList<>();
//        int len = nums.length;
//        if (len < 4) return res;
//        Arrays.sort(nums);
//        int max = nums[len - 1];
//        if (4 * max < target) return res;
//        for (int i = 0; i < len - 3;) {
//            if (nums[i] * 4 > target) break;
//            if (nums[i] + 3 * max < target) {
//                while (nums[i] == nums[++i] && i < len - 3) ;
//                continue;
//            }
//
//            for (int j = i + 1; j < len - 2;) {
//                int subSum = nums[i] + nums[j];
//                if (nums[i] + nums[j] * 3 > target) break;
//                if (subSum + 2 * max < target) {
//                    while (nums[j] == nums[++j] && j < len - 2) ;
//                    continue;
//                }
//
//                int left = j + 1, right = len - 1;
//                while (left < right) {
//                    int sum = subSum + nums[left] + nums[right];
//                    if (sum == target) {
//                        res.add(Arrays.asList(nums[i], nums[j], nums[left], nums[right]));
//                        while (nums[left] == nums[++left] && left < right);
//                        while (nums[right] == nums[--right] && left < right);
//                    } else if (sum < target) ++left;
//                    else --right;
//                }
//                while (nums[j] == nums[++j] && j < len - 2) ;
//            }
//            while (nums[i] == nums[++i] && i < len - 3) ;
//        }
//        return res;
//    }

    public List<List<Integer>> fourSum(int[] nums, int target) {
        Arrays.sort(nums);
        int len = nums.length;
        if (len < 4) return Collections.emptyList();
        int max = nums[len - 1];
        if (4 * max < target) return Collections.emptyList();
        return kSum(nums, 0, 4, target);
    }

    private List<List<Integer>> kSum(int[] nums, int start, int k, int target) {
        List<List<Integer>> res = new ArrayList<>();
        if (k == 2) {
            int left = start, right = nums.length - 1;
            while (left < right) {
                int sum = nums[left] + nums[right];
                if (sum == target) {
                    List<Integer> twoSum = new LinkedList<>();
                    twoSum.add(nums[left]);
                    twoSum.add(nums[right]);
                    res.add(twoSum);
                    while (nums[left] == nums[++left] && left < right) ;
                    while (nums[right] == nums[--right] && left < right) ;
                } else if (sum < target) ++left;
                else --right;
            }
        } else {
            int i = start, end = nums.length - (k - 1), max = nums[nums.length - 1];
            while (i < end) {
                if (nums[i] * k > target) return res;
                if (nums[i] + (k - 1) * max < target) {
                    while (nums[i] == nums[++i] && i < end) ;
                    continue;
                }
                List<List<Integer>> temp = kSum(nums, i + 1, k - 1, target - nums[i]);
                for (List<Integer> t : temp) {
                    t.add(0, nums[i]);
                }
                res.addAll(temp);
                while (nums[i] == nums[++i] && i < end) ;
            }
        }
        return res;
    }

    public static void main(String[] args) {
        Solution solution = new Solution();
        System.out.println(solution.fourSum(new int[]{1, 0, -1, 0, -2, 2}, 0));
    }
}