15.三数之和(python)

1. 先排序,利用双指针判断

class Solution:
    def threeSum(self, nums: List[int]) -> List[List[int]]:
        nums.sort()
        res =[]
        i = 0
        for i in range(len(nums)):
            if i == 0 or nums[i]>nums[i-1]:
                l = i+1
                r = len(nums)-1
                while l < r:
                    s = nums[i] + nums[l] +nums[r]
                    #找到了,加进去
                    if s ==0:
                        res.append([nums[i],nums[l],nums[r]])
                        l +=1
                        r -=1
                        #去除重复元素
                        while l < r and nums[l] == nums[l-1]:
                            l += 1
                        while r > l and nums[r] == nums[r+1]:
                            r -= 1
                    #大的数要变小一点右指针减一
                    elif s>0:
                        r -=1
                    else :
                        l +=1
        return res

2.利用字典记录元素数量

class Solution:
    def threeSum(self, nums: List[int]) -> List[List[int]]:
        dic={}
        for ele in nums:
            if ele not in dic:
                dic[ele] = 0
            dic[ele] += 1

        if 0 in dic and dic[0] > 2:
            rst = [[0, 0, 0]]
        else:
            rst = []

        pos = [p for p in dic if p > 0]
        neg = [n for n in dic if n < 0]

        for p in pos:
            for n in neg:
                inverse = -(p + n)
                if inverse in dic:
                    if inverse == p and dic[p] > 1:
                        rst.append([n, p, p])
                    elif inverse == n and dic[n] > 1:
                        rst.append([n, n, p])
                   	#约定这个数的大小,防止重复
                    elif inverse < n or inverse > p or inverse == 0:
                        rst.append([n, inverse, p])

        return rst