class Solution:
def findTriplets(self, nums):
# [-2, -2, -1, 0, 1, 2]
nums = sorted(nums)
n = len(nums)
ans_set = []
for i in range(n - 2):
if i > 0 and nums[i] == nums[i - 1]:
continue
if nums[i] > 0:
break
j = i + 1
while j < n - 1:
if j > i + 1 and nums[j] == nums[j - 1]:
j += 1
continue
if (nums[i] + nums[j]) > 0:
break
for k in range(j + 1, n):
if nums[i] + nums[j] + nums[k] > 0:
break
elif nums[i] + nums[j] + nums[k] == 0:
ans_set.append([nums[i], nums[j], nums[k]])
break
j += 1
return ans_set
if __name__ == '__main__':
sol = Solution()
# print(sol.findTriplets([-1, 0, 1, 2, -1, -4]))
# print(sol.findTriplets([2, -1, 1, -2, 0, -2]))
print(sol.findTriplets([0, 0, 0, 0, 0, 0]))