LeetCode力扣之kSum

最新推荐文章于 2024-05-01 00:58:01 发布

Lee_Wei4939

最新推荐文章于 2024-05-01 00:58:01 发布

阅读量300

点赞数

分类专栏：算法面试

本文链接：https://blog.csdn.net/liwei1205/article/details/79437292

版权

算法面试专栏收录该内容

89 篇文章 0 订阅

订阅专栏

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

import java.util.ArrayList;
import java.util.Arrays;
import java.util.List;

/**
 * Created by lxw, liwei4939@126.com on 2018/3/4.
 */
public class kSum {
    /*
    kSum问题可以划分为两个子问题：
    1. 2Sum 问题
    2. 将 kSum 问题降低为 k-1 Sum 问题
     */
    int len = 0;
    public List<List<Integer>> fourSum(int[] nums, int target){

        len = nums.length;
        Arrays.sort(nums);
        return kSum(nums, target, 4, 0);
    }

    private ArrayList<List<Integer>> kSum(int[] nums, int target, int k, int index){
        ArrayList<List<Integer>> res = new ArrayList<List<Integer>>();
        if (index >= len){
            return res;
        }

        if (k == 2){
            int i = index, j=len - 1;
            while (i < j){
                if (target - nums[i] == nums[j]){
                    List<Integer> tmp = new ArrayList<>();
                    tmp.add(nums[i]);
                    tmp.add(nums[j]);
                    res.add(tmp);

                    while (i < j && nums[i] == nums[i+1]) i++;
                    while (i < j && nums[j] == nums[j-1]) 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>> tmp = kSum(nums, target - nums[i], k-1, i+1);
                if (tmp != null){
                    for (List<Integer> t : tmp){
                        t.add(0, nums[i]);
                    }
                    res.addAll(tmp);
                }
                while (i < len -1 && nums[i] == nums[i+1]){
                    i++;
                }
            }
        }

        return res;
    }

    public static void main(String[] args){
        kSum tmp = new kSum();
        int[] nums = new int[]{1, 0, -1, 0, -2, 2};
        List<List<Integer>> res = tmp.fourSum(nums, 0);
        System.out.println(res);
    }
}