三天一题-23- 4Sum

题目地址: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 2:
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]
]
The sum that is closest to the target is 2. (-1 + 2 + 1 = 2).

import com.sun.tools.javac.util.ArrayUtils;

import java.util.*;

//四个数相加
public class FourNums {
    /**
     * Given array nums = [1, 0, -1, 0, -2, 2], and target = 0.
     * [-2,-1,0,0,1,2]
     * A solution set is:
     * [
     *   [-1,  0, 0, 1],
     *   [-2, -1, 1, 2],
     *   [-2,  0, 0, 2]
     * ]
     */
    public static void main(String[] args) {
        int[] arr ={1, 0, -1, 0, -2, 2,-3,3};
        int target =0;
        Set<List> integers = addFourNums(arr, target);
        System.out.println(integers);
    }
    //四位数转化成3位数来算
    public static Set<List> addFourNums(int[] arr, int target){
        Arrays.sort(arr);
        Set<List> res = new HashSet<>();
        int length = arr.length-1;
        for (int i = 0; i < length; i++) {
            for (int j = i+1; j < length; j++) {
                int fakeTarget = target - arr[i] - arr[j];
                addThreeNums(j+1,length,arr, fakeTarget,res,i);
            }
        }

        return res;
    }
    //三个数相加
    public static void addThreeNums(int start, int end, int[] arr, int fakeTarget, Set<List> res, int j){
        int index = start-1;
        while(start<end){
            int num = fakeTarget - arr[start] - arr[end];
            if (num == 0) {
                ArrayList<Integer> list = new ArrayList<>();
                list.add(arr[j]);
                list.add(arr[index]);
                list.add(arr[start]);
                list.add(arr[end]);
                //  顺序一样,内容一样的list可以去重。
                res.add(list);
                start++;
            }
                if (num > 0)  start++;
                if (num < 0)  end--;

            }
    }

}

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值