题解 | #牛牛的三元组问题#

#先排序，再遍历找出符合的解，将解排序判断是否在已有解集合中，不在就加入，最后将解集合排序返回
#coding:utf-8
#
# 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
#
# 
# @param nums int整型一维数组 
# @return int整型二维数组
#
class Solution:
    def findTriplets(self , nums ):
        # print(nums)
        sorted(nums)
        res=[]
        for i in range(len(nums)):
            for j in range(i+1,len(nums)):
                for k in range(j+1,len(nums)):
                    if int(nums[i])+int(nums[j])+int(nums[k])==0:
                        if sorted([int(nums[i]),int(nums[j]),int(nums[k])]) not in res:
                            res.append(sorted([int(nums[i]),int(nums[j]),int(nums[k])]))
        return sorted(res)
        # write code here