15. 三数之和

class Solution:
    def threeSum(self, nums: List[int]) -> List[List[int]]:

        res = []
        l = len(nums)
        nums.sort()

        i = 0
        while i < l-2:
            if nums[i] > 0:
                break
            else:
                j = i + 1
                k = l - 1
                target = -nums[i]
                while j < k:
                    if nums[j] + nums[k] == target:
                        res.append([nums[i], nums[j], nums[k]])
                        while j < k and nums[k] == nums[k-1]:
                            k -= 1
                        while j < k and nums[j] == nums[j+1]:
                            j += 1
                        j += 1
                        k -= 1
                    elif nums[j] + nums[k] > target:
                        while j < k and nums[k] == nums[k-1]:
                            k -= 1
                        k -= 1
                    else:
                        while j < k and nums[j] == nums[j+1]:
                            j += 1
                        j += 1
            while i < l-2 and nums[i] == nums[i+1]:
                i += 1
            i += 1
        return res

双指针法，注意如何避免重复元素