4Sum

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:

• 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)

Show Tags

Hav

思路：跟3Sum一样，用两个指针前后移动，这样只用扫描一次。O(n3)

然后用hashset去重复。

public class Solution { 
    public List<List<Integer>> fourSum(int[] num, int target) { 
        List<List<Integer>> result = new ArrayList<List<Integer>>(); 
        HashSet<ArrayList<Integer>> hashset = new HashSet<ArrayList<Integer>>(); 
         
        Arrays.sort(num); 
         
        for(int i=0; i<num.length-3; i++){ 
            for(int j=i+1; j<num.length-2; j++){ 
                int k=j+1; int l = num.length-1; 
                while(k<l){ 
                    if(num[i]+num[j]+num[k]+num[l]>target){ 
                        l--; 
                    }else if(num[i]+num[j]+num[k]+num[l]<target){ 
                        k++; 
                    }else{ 
                        ArrayList<Integer> list = new ArrayList<Integer>(); 
                        list.add(num[i]); 
                        list.add(num[j]); 
                        list.add(num[k]); 
                        list.add(num[l]); 
                        if(!hashset.contains(list)){ 
                            hashset.add(list); 
                            result.add(list); 
                        } 
                        k++; 
                        l--; 
                    } 
                } 
            } 
        } 
        return result; 
    } 
}

不用hashset,去重复，就是要判断重复点，逻辑跟3sum一样；

public class Solution {
    public List<List<Integer>> fourSum(int[] num, int target) {
        List<List<Integer>> lists = new ArrayList<List<Integer>>();
        if(num.length == 0) return lists;
       
        Arrays.sort(num);
        
        for(int i=0; i<num.length-3; i++){
            if(i>0 && num[i] == num[i-1]){
                continue;
            }
            for(int j=i+1; j<num.length-2; j++){
                if(j>i+1 && num[j] == num[j-1]){
                    continue;
                }
                int l = j+1, k=num.length -1;
                while(l<k){
                    int sum = num[i]+num[j]+num[l]+num[k];
                    if(sum == target){
                     
                        List<Integer> list = new ArrayList<Integer>();
                        list.add(num[i]);
                        list.add(num[j]);
                        list.add(num[l]);
                        list.add(num[k]);
                        lists.add(list);
                        
                        l++;
                        k--;
                        
                        while(l<k && num[l] == num[l-1] && num[k] == num[k+1]){
                            l++;
                            k--;
                        }
                   
                    }else if(sum>target){
                        k--;
                    }else{
                        l++;
                    }
                }
            }
        }
        return lists;
    }
}