15. 3Sum【M】【28】

最新推荐文章于 2023-03-23 16:29:06 发布

sscssz

最新推荐文章于 2023-03-23 16:29:06 发布

阅读量476

点赞数

分类专栏： leetcode Python 算法双指针字符串文章标签： leetcode leetcode题解 python string 双指针

本文链接：https://blog.csdn.net/sscssz/article/details/51545459

版权

Python 同时被 3 个专栏收录

176 篇文章 0 订阅

订阅专栏

leetcode

175 篇文章 0 订阅

订阅专栏

算法

157 篇文章 0 订阅

订阅专栏

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)

Subscribe to see which companies asked this question

关键在于两个指针，如果和小于零，左边的坐标增长，反之右边的左边增长

class Solution(object):
    def threeSum(self, nums):

        nums.sort()
        #print nums
        res = []
        minn = 1 << 31

        for i in xrange(len(nums)):
            a = 0
            b = len(nums) - 1
            while a < i and b > i:
                print i,a,b,nums[a],nums[i],nums[b]
                if nums[a] + nums[b] + nums[i] == 0:
                    if [nums[a],nums[i],nums[b]] not in res:
                        res += [nums[a],nums[i],nums[b]],
                    a += 1
                    b -= 1
                    continue
                if nums[a] + nums[b] + nums[i] <= 0:
                    a += 1
                else:
                    b -= 1

        '''
        #nums = set(nums)
        #print nums
        minn = 1 << 31
        #print minn
        res = []

        per = itertools.combinations(nums,3)
        for i in per:
            #print i
            summ = sum(i)#i[0] + i[1] + i[2]
            if summ == 0 and i not in res:
                res.append(i)

        #for i in xrange(len(nums)):
        #    print nums[i]
        '''
        return res

        """
        :type nums: List[int]
        :rtype: List[List[int]]
        """