solution1.py

class Solution:
    def threeSum(self, nums: List[int]) -> List[List[int]]:
        nums.sort()
        res = set()
        for i in range(len(nums)-2):
            a = nums[i]
            for j in range(i+1, len(nums)-1):
                b = nums[j]
                c = -(a+b)
                if c < nums[j+1]:
                    continue
                idx = bisect.bisect_left(nums[j+1:], c)
                if idx+j+1>=len(nums) or nums[idx+j+1]!=c:
                    continue
                else:res.add((a,b,c))
        return [list(r) for r in res]