LeetCode 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.

Example

Note

The solution set must not contain duplicate quadruplets.

Code

• java

class Solution {
    public List<List<Integer>> fourSum(int[] nums, int target) {
        List<List<Integer>> result = new ArrayList<>();
        Arrays.sort(nums);
        int len = nums.length;
        for(int i = 0; i < len - 3; i++) {
            if(i != 0 && nums[i] == nums[i-1]) continue;
            for(int j = i + 1; j < len - 2; j++) {
                if(j != i + 1 && nums[j] == nums[j-1]) continue;
                int lo = j + 1, hi = len-1;
                int sum = target - nums[i] - nums[j];
                while(lo < hi) {
                    if(nums[lo] + nums[hi] == sum) {
                        result.add(Arrays.asList(nums[i], nums[j], nums[lo], nums[hi]));  
                        lo++;
                        hi--;
                        while(lo < hi && nums[lo] == nums[lo-1]) lo++;
                        while(lo < hi && nums[hi+1] == nums[hi]) hi--;
                    } else if(nums[lo] + nums[hi] > sum) {
                        hi--;
                    } else {
                        lo++;
                    }
                }
                
            }
        }
        return result;
    }
}

• Others’ Solution
  • python

def fourSum(self, nums, target):
    def findNsum(nums, target, N, result, results):
        if len(nums) < N or N < 2 or target < nums[0]*N or target > nums[-1]*N:  # early termination
            return
        if N == 2: # two pointers solve sorted 2-sum problem
            l,r = 0,len(nums)-1
            while l < r:
                s = nums[l] + nums[r]
                if s == target:
                    results.append(result + [nums[l], nums[r]])
                    l += 1
                    while l < r and nums[l] == nums[l-1]:
                        l += 1
                elif s < target:
                    l += 1
                else:
                    r -= 1
        else: # recursively reduce N
            for i in range(len(nums)-N+1):
                if i == 0 or (i > 0 and nums[i-1] != nums[i]):
                    findNsum(nums[i+1:], target-nums[i], N-1, result+[nums[i]], results)

    results = []
    findNsum(sorted(nums), target, 4, [], results)
    return results

Conclusion

• 2sum变形
• 学习大佬的py解法