leetcode15 三数之和

def threeSumClosest(nums,target):
    result = list()
    n = len(nums)
    if n < 3:
        return result
    l, r, dif = 0, 0, 0
    nums.sort()
    for i in range(n - 2):
        if nums[i] > 0:
            break
        if i > 0 and nums[i - 1] == nums[i]:
            continue

        l = i + 1
        r = n - 1
        dif = -nums[i]
        while l < r:
            if nums[l] + nums[r] == dif:
                result.append([nums[l], nums[r], nums[i]])
                '''
                如果和之前元素相等，忽略
                '''
                while l < r and nums[l] == nums[l + 1]:
                    l += 1
                while l < r and nums[r] == nums[r - 1]:
                    r -= 1
                l += 1
                r -= 1
            elif nums[l] + nums[r] < dif:
                l += 1
            else:
                r -= 1

    return result