leetcode 18. 四数之和四数之和 python

方案一 时间复杂度O（n^3）
跟三数求和的思想一样
思路：固定2个数，利用双指针。 特别记住去除重复项的方法。

class Solution:
    def fourSum(self, nums: List[int], target: int) -> List[List[int]]:
        nums.sort(); res = []
        for i in range(len(nums)-3):
            if i > 0 and nums[i] == nums[i-1]: # 去除重复项
                continue # 跳过本次循环，执行下一次
            for j in range(i + 1 ,len (nums)-2):
                if j > i + 1 and nums[j] == nums[j-1]: # 去除重复项
                    continue 
                l = j + 1
                r = len(nums) - 1
                while l < r:
                    sum = nums[i] + nums[j] + nums[l] + nums[r]
                    if sum > target:
                        r -= 1
                    elif sum < target:
                        l += 1
                    else :
                        res.append([nums[i],nums[j],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
        return res

方案二 复杂度为O（n^2)

class Solution:
    def fourSum(self, num: List[int], target: int) -> List[List[int]]:
        numLen, res, dict = len(num), set(), {}
        if numLen < 4: 
            return []
        num.sort()
        for p in range(numLen):
            for q in range(p+1 , numLen): 
                if num[p] + num[q] not in dict:
                    dict[num[p] + num[q]] = [(p,q)]
                else :
                    dict[num[p] + num[q]].append((p,q))
        for i in range(numLen):
            for j in range(i+1, numLen-2 ):
                T = target-num[i]- num[j]
                if T in dict:
                    for k in dict[T]:
                        if k[0] > j: res.add((num[i],num[j],num [k[0]],num[k[1 ]]))
        return [list(i) for i in res]