三数之和

最新推荐文章于 2023-12-17 22:48:59 发布

Mu__Cheng

最新推荐文章于 2023-12-17 22:48:59 发布

阅读量126

点赞数

分类专栏：基础算法（leetcode）刻意练习

本文链接：https://blog.csdn.net/TayTay123/article/details/104660132

版权

基础算法（leetcode）刻意练习专栏收录该内容

30 篇文章 0 订阅

订阅专栏

在这里插入图片描述 Python

class Solution:
    def threeSum(self, nums):
        nums.sort()
        count = []
        length = len(nums)
        for i in range(length):
            if i > 0 and nums[i] == nums[i-1]:
                continue
            if nums[i] > 0:
                break
            l = i + 1
            r = length - 1
            while l < r:
                s = nums[i] + nums[l] + nums[r]
                if  s == 0:
                    count.append([nums[i], nums[l], nums[r]])
                    while (l < r) and (nums[l+1] == nums[l]):
                        l += 1
                    while (l < r) and (nums[r-1] == nums[r]):
                        r -= 1
                    l += 1
                    r -= 1
                elif s < 0:
                    l += 1
                else:
                    r -= 1
        return count