leetcode 15. 3Sum

给一个数组，找出所有的不相同的三元组相加为0.先排序，然后循环最小值，剩下两个值用two point从两侧向中间跑一遍，求出所有结果即可，复杂度o(n^2)。注意处理下重复

class Solution(object):
    def threeSum(self, nums):
        """
        :type nums: List[int]
        :rtype: List[List[int]]
        """
        nums.sort()

        n = len(nums)
        if n <= 2: return []
        
        res = []
        i = 0
        while i < n-2 :
            l = i + 1
            r = n - 1
            while(l < r):
                if (nums[i] + nums[l] + nums[r] > 0):
                    r = r - 1
                elif (nums[i] + nums[l] + nums[r] < 0):
                    l = l + 1
                else:
                    #print nums[i],nums[l],nums[r]
                    tmp = [nums[i],nums[l],nums[r]] 
                    res.append(tmp)
                    l += 1
                    r -= 1

                    while l < r and nums[l] == nums[l - 1]: l += 1
                    while l < r and nums[r] == nums[r + 1]: r -= 1
                    while i < n - 2 and nums[i] == nums[i + 1]:
                        i += 1
            i += 1


        return res