leetcode.three sum

def threeSum(nums):
    n = len(nums)
    res = []
    nums.sort()
    for i in range(n - 2):
        if nums[i] + nums[i + 1] + nums[i + 2] > 0:
            break
        if nums[i] + nums[n - 2] + nums[n - 1] < 0:
            continue
        if i > 0 and nums[i] == nums[i - 1]:
            continue
        left, right = i + 1, n - 1
        while left < right:
            tmp = nums[i] + nums[left] + nums[right]
            if tmp == 0:
                res.append([nums[i], nums[left], nums[right]])
                while left + 1 < right and nums[left] == nums[left + 1]:
                    left += 1
                while left < right - 1 and nums[right] == nums[right - 1]:
                    right -= 1
                left += 1
                right -= 1
            elif tmp < 0:
                left += 1
            else:
                right -= 1
    return res