4sum问题用python_LeetCode 18 4sum Python 高效解法

class Solution:

def fourSum(self, nums, target):

"""

:type nums: List[int]

:type target: int

:rtype: List[List[int]]

"""

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

网上找的递归的4sum解法，效率非常高，做一下保存，值的细细品味