15. 3Sum leetcode python 2016 new Season

hyperbolechi

于 2016-01-06 11:07:01 发布

阅读量390

点赞数

CC 4.0 BY-SA版权

分类专栏： leetcode 2016刷题

本文链接：https://blog.youkuaiyun.com/hyperbolechi/article/details/50467534

leetcode 同时被 2 个专栏收录

166 篇文章

订阅专栏

2016刷题

45 篇文章

订阅专栏

本文介绍了一种方法来查找整数数组中三个元素之和为零的唯一三元组，并确保这些元素按非递减顺序排列且不包含重复三元组。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Given an array S of n integers, are there elements a, b, c in S such that a + b + c = 0? Find all unique triplets in the array which gives the sum of zero.

Note:

Elements in a triplet (a,b,c) must be in non-descending order. (ie, a ≤ b ≤ c)
The solution set must not contain duplicate triplets.

    For example, given array S = {-1 0 1 2 -1 -4},

    A solution set is:
    (-1, 0, 1)
    (-1, -1, 2)

Show Company Tags

Show Tags

Show Similar Problems

Have you met this question in a real interview?

Yes

Discuss

class Solution(object):
    def threeSum(self, nums):
        """
        :type nums: List[int]
        :rtype: List[List[int]]
        """
        nums.sort()
        result = []
        nums_length = len(nums)
        for index in range(nums_length - 1):
            if index > 0 and nums[index] == nums[index - 1]:
                continue
            left = index + 1
            right = nums_length - 1
            while left < right:
                num_sum = nums[left] + nums[right] + nums[index]
                if num_sum == 0 and [nums[index], nums[left], nums[right]] not in result:
                    result.append([nums[index], nums[left], nums[right]])
                if num_sum < 0:
                    left += 1
                else:
                    right -= 1
        return result