LeetCode 之 4Sum

题目链接：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: 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差不多，就是在最外面再加层循环；首先主要的是要对数组排序，其次是注意元素重复问题；

代码实现如下：

class Solution {
    public List<List<Integer>> fourSum(int[] nums, int target) {
        int len = nums.length;
        List<List<Integer>> re = new ArrayList<>();
        if(len<4){
            return re;
        }

        Arrays.sort(nums);

        int i, j, k, t;

        for(i = 0;i<len-3;i++){
            if(i==0 || nums[i]!=nums[i-1]){
                for(j = i+1;j<len-2;j++){
                    //第二个元素不能重复，但是注意其可以与第一元素相同
                    if(j==i+1 || nums[j]!=nums[j-1]){
                        k = j+1;
                        t = len-1;
                        while(k < t){
                            int sum = nums[i]+nums[j]+nums[k]+nums[t];
                            if(sum==target){
                                ArrayList<Integer> temp = new ArrayList<Integer>();
                                temp.add(nums[i]);
                                temp.add(nums[j]);
                                temp.add(nums[k]);
                                temp.add(nums[t]);
                                re.add(temp);

                            while(k<t && nums[k]==nums[k+1])
                                k++;
                            while(k<t && nums[t]==nums[t-1])
                                t--;
                            k++;
                            t--;
                            }
                            if(sum>target)
                                t--;
                            if(sum<target)
                                k++;
                        } 
                    }
            }

            }
        }
        return re;
    }
}