15. 3sum Python 实现

15.  3sum问题描述：

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: 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]
]

分析：

先排序，然后左右夹逼，时间复杂度O(n^2).可以推广到 k-sum ，先做 k-2次循环，在最内层做夹逼

class Solution(object):
    def threeSum(self, nums):
        """
        :type nums: List[int]
        :rtype: List[List[int]]
        """
        result = []
        if len(nums) < 3:
            return result
        nums.sort()  #  先排序
        for i in range(0, len(nums)):
            j = i + 1
            k = len(nums) - 1
            if i > 0 and nums[i] == nums[i - 1]:
                continue  #  注意跳过重复的数，不然全0的长list会超时
            while j < k:
                sum = nums[i] + nums[j] + nums[k]
                if sum == 0:
                    result.append((nums[i], nums[j], nums[k]))
                    k -= 1
                    j += 1
                    while(nums[j] == nums[j - 1] and nums[k] == nums[k + 1] and j < k): 
                        j += 1
                elif sum > 0:
                    k -= 1
                    while(nums[k] == nums[k + 1] and j < k):
                        k -= 1
                else:
                    j += 1
                    while(nums[j] == nums[j - 1] and j < k):
                        j += 1
        return list(set(result))  #  去重