LeetCode Java First 400 题解-018_leetcode 400 题详解-CSDN博客

本文链接：https://blog.csdn.net/felomeng/article/details/102811114

本文介绍了一种解决4Sum问题的有效算法，即在整数数组中寻找四个元素之和等于目标值的所有唯一四元组组合。通过排序和递归地将问题转化为更简单形式，避免重复解和无效搜索，实现高效求解。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

4Sum Medium

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: 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 List<List<Integer>> fourSum(int[] nums, int target) {

    int n = nums.length;

    Arrays.sort(nums);

    return kSum(nums, target, 4, 0, n);

}



private static ArrayList<List<Integer>> kSum(int[] nums, int target, int k,

                                             int index, int len) {

    ArrayList<List<Integer>> res = new ArrayList<List<Integer>>();

    if (index >= len)

        return res;

    int max = nums[nums.length - 1];

    if (k * nums[index] > target || k * max < target)

        return res;

    if (k == 2) {

        int i = index, j = len - 1;

        while (i < j) {

            if (target - nums[i] == nums[j]) {

                List<Integer> temp = new ArrayList<>();

                temp.add(nums[i]);

                temp.add(target - nums[i]);

                res.add(temp);

                while (i < j && nums[i] == nums[i + 1])

                    i++;

                while (i < j && nums[j - 1] == nums[j])

                    j--;

                i++;

                j--;

            } else if (target - nums[i] > nums[j])

                i++;

            else

                j--;

        }

    } else {

        for (int i = index; i < len - k + 1; i++) {

            ArrayList<List<Integer>> temp = kSum(nums, target - nums[i],

                    k - 1, i + 1, len);

            if (temp != null) {

                for (List<Integer> t : temp)

                    t.add(0, nums[i]);

                res.addAll(temp);

            }

            while (i < len - 1 && nums[i] == nums[i + 1])

                ++i;//去重

        }

    }

    return res;

}

思路：同3Sum，转化为更低阶处理。首先排序，当k>2时逐一试看是否有结果（注意排重和中断不可能的情况），当K=2时，使用夹逼法。