LeetCode | 4Sum

18. 4Sum

Description

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

Solution: (Java)

class Solution {
    public List<List<Integer>> fourSum(int[] nums, int target) {
        List<List<Integer>> result = new ArrayList<List<Integer>>();
        Arrays.sort(nums);
        int left, right, sum;
        for (int i = 0; i < nums.length-3; i++) {
            if (i == 0 || nums[i] != nums[i-1]) {
                for (int j = i+1; j < nums.length-2; j++) {
                    if (j == i+1 || nums[j] != nums[j-1]) {
                        left = j + 1;
                        right = nums.length - 1;
                        while (left < right) {
                            sum = nums[i] + nums[j] + nums[left] + nums[right];
                            if (sum == target) {
                                List<Integer> list = new ArrayList<Integer>();
                                list.add(nums[i]);
                                list.add(nums[j]);
                                list.add(nums[left]);
                                list.add(nums[right]);
                                result.add(list);
                                left++;
                                right--;

                                while (left < right && nums[left] == nums[left-1])
                                    left++;
                                while (left < right && nums[right] == nums[right+1])
                                    right--;
                            } else if (sum > target) {
                                right--;
                                while (left < right && nums[right] == nums[right+1])
                                    right--;
                            } else {
                                left++;
                                while (left < right && nums[left] == nums[left-1])
                                    left++;
                            }
                        }
                    }
                }
            }

        }

        return result;
    }
}

思路

本题思路与 3Sum 类似，LeetCode | 3Sum 的扩展，外面加多一层循环即可，不再赘述。另外，发现像之前提到的num[i] > target这样的剪枝操作并不能用（target小于0时）。