LeetCode 18. 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题目，且优化到时间复杂度O(n^2)的同学，这道题应该可以直接写了，把0换成target，最外层再加一层循环。
• 3Sum解析链接，点击这里

代码：

public List<List<Integer>> fourSum(int[] nums, int target) {
        Arrays.sort(nums);
        List<List<Integer>> returnList = new ArrayList<>();
        for(int o=0;o<nums.length-3;o++){
            if (o > 0 && nums[o] == nums[o - 1]) {              // skip same result
                continue;
            }
            for(int i=o+1;i<nums.length-2;i++){
                if (i > o+1 && nums[i] == nums[i - 1]) {              // skip same result
                    continue;
                }
                int j = i + 1, k = nums.length - 1;
                while (j < k) {
                    if (nums[o]+nums[i]+nums[j]+nums[k]==target) {
                        returnList.add(Arrays.asList(nums[o], nums[i], nums[j], nums[k]));
                        j++;
                        k--;
                        while (j < k && nums[j] == nums[j - 1]) j++;  // skip same result
                        while (j < k && nums[k] == nums[k + 1]) k--;  // skip same result
                    } else if (nums[o]+nums[i]+nums[j]+nums[k]>target) {
                        k--;
                    } else {
                        j++;
                    }
                }
            }
        }
        return returnList;
    }