LeetCode：15三数之和

# 给你一个包含 n 个整数的数组 nums，判断 nums 中是否存在三个元素 a，b，c ，
# 使得 a + b + c = 0 ？请你找出所有和为 0 且不重复的三元组。
# 注意：答案中不可以包含重复的三元组。
#
# 示例 1：
# 输入：nums = [-1,0,1,2,-1,-4]
# 输出：[[-1,-1,2],[-1,0,1]]
#
# 示例 2：
# 输入：nums = []
# 输出：[]
#
# 示例 3：
# 输入：nums = [0]
# 输出：[]
#
# 提示：
# 0 <= nums.length <= 3000
# -105 <= nums[i] <= 105

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

        if num_l < 3 or nums[0] > 0:
            return res

        for i in range(num_l):
            if i > 0 and nums[i] == nums[i - 1]:
                continue
            else:
                l = i + 1
                r = num_l - 1
                while l < r:
                    if nums[i] + nums[l] + nums[r] == 0:
                        res.append([nums[i], nums[l], nums[r]])
                        l += 1
                        r -= 1
                    elif nums[i] + nums[l] + nums[r] < 0:
                        l += 1
                    else:
                        r -= 1
        res = list(set([tuple(t) for t in res]))
        return res


if __name__ == '__main__':
    solution = Solution
    num = solution.threeSum(solution,[-1,0,1,2,-1,-4])
    print(num)
    num = solution.threeSum(solution, [])
    print(num)
    num = solution.threeSum(solution, [0])
    print(num)

# 输出结果：

[(-1, 0, 1), (-1, -1, 2)]
[]
[]