Leetcode-Python 三数之和

class Solution:
    def threeSum(self, nums: List[int]) -> List[List[int]]:
        result = []
        nums.sort()
        for i in range(len(nums)-2):
            if nums[i] > nums[i-1] or i == 0:
                left = i + 1
                right = len(nums) - 1
                while left < right:
                    temp = nums[i] + nums[left] + nums[right]
                    if temp == 0:
                        res = [nums[i],nums[left],nums[right]]
                        result.append(res)
                        left += 1
                        right -= 1
                        while nums[left] == nums[left-1] and left < right:
                            left += 1
                        while nums[right] == nums[right+1] and left < right:
                            right -= 1
                    elif temp > 0:
                        right -= 1
                    else:
                        left += 1
        return result

github项目地址：https://github.com/JockWang/LeetCode-Python