LeetCode18. 4Sum （思路及python解法）

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

---

找出数组中的四个数字，使四个数和为0。

这个题和3sum都差不多，最后都归到2sum。

先将数组排序，然后用for循环，去找3sum，2sum，最后返回全部结果。

class Solution:
    def fourSum(self, nums: List[int], target: int) -> List[List[int]]:
        self.results=[]
        nums.sort()
        self.findNum(nums, target, 4, [])
        return self.results
    
    def findNum(self, nums, target, N, result):
        if len(nums)<N or N<2:return
        
        if N == 2:
            l, r = 0, len(nums)-1
            while l<r:
                sumx=nums[l]+nums[r]
                if sumx==target:
                    self.results.append(result+[nums[l],nums[r]])
                    l+=1
                    r-=1
                    while l<r and nums[l]==nums[l-1]:
                        l+=1
                    while l<r and nums[r]==nums[r+1]:
                        r-=1
                elif sumx>target:
                    r-=1
                else:
                    l+=1
        else:
            for i in range(len(nums)-N+1):
                if nums[i]*N>target or nums[-1]*N<target:break
                if i==0 or (i>0 and nums[i-1]!=nums[i]):
                    self.findNum(nums[i+1:], target-nums[i], N-1, result+[nums[i]])