LeetCode—4sum(四个数求和)—java

题目描述：

Given an array S of n integers, are there elements a, b, c, and d in Ssuch 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)

思路解析：

与求三个数的和是一个思路

• 先排序，Arrays.sort(num)
• 固定i和j，去找low和high
• 使用Hashset防止重复

代码：

import java.util.*;
public class Solution {
    public ArrayList<ArrayList<Integer>> fourSum(int[] num, int target) {
        ArrayList<ArrayList<Integer>> res = new ArrayList<ArrayList<Integer>>();
        HashSet<ArrayList<Integer>> hs = new HashSet<ArrayList<Integer>>();
        if(num==null || num.length<4)
            return res;
        Arrays.sort(num);
        for(int i =0;i<=num.length-4;i++){//注意i的范围
            for(int j = i+1;j<=num.length-3;j++){//注意j的范围
                int low = j+1;
                int high = num.length-1;
                while(low<high){
                    int sum = num[i]+num[j]+num[low]+num[high];
                    if(sum == target){
                        ArrayList<Integer> al = new ArrayList<Integer>();
                        al.add(num[i]);
                        al.add(num[j]);
                        al.add(num[low]);
                        al.add(num[high]);
                        if(!hs.contains(al)){
                            hs.add(al);
                            res.add(al);
                        }
                        low++;
                        high--;
                    }else if(sum<target){
                        low++;
                    }else {
                        high--;
                    }
                }
            }
        }
        return res;
    }
}