4Sum (Java)

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)

和3sum差不多，多加一维，用low，high方法首先要记得对数组排序

Source

public class Solution {
    public List<List<Integer>> fourSum(int[] num, int target) {
        List<List<Integer>> st = new ArrayList<List<Integer>>();
        HashSet<ArrayList<Integer>> set = new HashSet<ArrayList<Integer>>();
        if(num.length <= 3) return st;
        
        Arrays.sort(num);
        int sum;
        for(int i = 0; i < num.length - 3; i++){
        	for(int j = i + 1; j < num.length - 2; j++ ){  //j要从i+1开始，否则会出现重复，并且hashset检测不出来
        		int low = j + 1;	//从j + 1开始
        		int high = num.length - 1;
        		
        		while(low < high){
        			sum = num[i] + num[j] + num[low] + num[high];
        			
        			if(sum == target){
        				ArrayList<Integer> a = new ArrayList<Integer>();
        				a.add(num[i]);
        				a.add(num[j]);
        				a.add(num[low]);
        				a.add(num[high]);
        				if(!set.contains(a)){ //只会检测每一位都一模一样的 比如1,0,-1和-1, 0, 1就检测不出来
        					set.add(a);
        					st.add(a);
        				}
        				low ++;
        				high --;
        			}
        			else{
        				if(sum < target){
        					low ++;
        				}
        				else{
        					high --;
        				}
        			}
        		}
        	}
        }
        return st;
    }
}

Test

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