Leetcode15-三数之和

Leetcode15-三数之和

思路：双指针

代码：（时间复杂度较高）

class Solution:
    def threeSum(self, nums: List[int]) -> List[List[int]]:
        nums.sort()
        print(nums)
        start = 0
        # left = 1
        res = []
        while start < len(nums):
            left = start + 1
            right = len(nums) - 1
            while left < right:
                if nums[start] * (-1) == nums[left] + nums[right]and [nums[start], nums[left], nums[right]] not in res:
                    res.append([nums[start], nums[left], nums[right]])
                    left += 1
                    right -= 1
                elif nums[start] * (-1) > nums[left] + nums[right]:
                    left += 1
                else:
                    right -= 1
            start += 1
        return res

稍微优化一下，当nums[start] > 0时，结束循环，因为是排好序的，如果nums[start] 已经> 0，那么三数之和不可能为0。

class Solution:
    def threeSum(self, nums: List[int]) -> List[List[int]]:
        nums.sort()
        print(nums)
        start = 0
        # left = 1
        res = []
        while start < len(nums) and nums[start] <= 0:#加了一个条件：nums[start] <= 0
            left = start + 1
            right = len(nums) - 1
            while left < right:
                if nums[start] * (-1) == nums[left] + nums[right]and [nums[start], nums[left], nums[right]] not in res:
                    res.append([nums[start], nums[left], nums[right]])
                    left += 1
                    right -= 1
                elif nums[start] * (-1) > nums[left] + nums[right]:
                    left += 1
                else:
                    right -= 1
            start += 1
        return res