#15 3Sum

最新推荐文章于 2024-07-10 19:27:42 发布

熊怪要变码农啦

最新推荐文章于 2024-07-10 19:27:42 发布

阅读量239

点赞数

本文链接：https://blog.csdn.net/yzh3558/article/details/123036555

版权

LeetCode Hot 专栏收录该内容

4 篇文章 0 订阅

订阅专栏

Given an integer array nums, return all the triplets [nums[i], nums[j], nums[k]] such that i != j, i != k, and j != k, and nums[i] + nums[j] + nums[k] == 0.

Notice that the solution set must not contain duplicate triplets.

class Solution:
    def threeSum(self, nums):

        # 巨慢
        nums.sort()
        res = []

        for index1 in range(len(nums)):
            index2, index3 = index1 + 1, len(nums) - 1

            while index2 < index3:
                temp = nums[index1] + nums[index2] + nums[index3]

                # sum == 0
                if temp == 0:
                    # 去重
                    if [nums[index1], nums[index2], nums[index3]] not in res:
                        res.append([nums[index1], nums[index2], nums[index3]])
                    index3 -= 1
                elif temp > 0:
                    index3 -= 1
                else:
                    index2 += 1

        return res