15. 3Sum leetcode python 2016 new Season

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

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

Given an array S of n integers, are there elements abc 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
 
No

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


评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值