18. 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:

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

先固定一个元素，把它变成3-sum问题。

public static void main(String[] args){
       ArrayList<ArrayList<Integer>> result=new ArrayList<>();
       int[] num={2,4,-3,3,5,8,-9,0,0,1,-2};
       int target=1;
       if(num==null&&num.length<4)
            System.out.println(result); 
       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 left = j + 1, right = num.length - 1;

                while(left < right){
                    int sum = num[i] + num[j] + num[left] + num[right];
                    if(sum == target){
                        ArrayList<Integer> list = new ArrayList<Integer>();
                        list.add(num[i]);
                        list.add(num[j]);
                        list.add(num[left]);
                        list.add(num[right]);
                        result.add(list);
                        left ++;
                        right --;
                        while(left < right && num[left] == num[left - 1])
                            left ++;
                        while(left < right && num[right] == num[right + 1])
                            right --;
                    } else if(sum < target) {
                        left ++;
                    } else {
                        right--;
                    }
                }                
            }
        }

             System.out.println(result); 
    }