优化解决方案运行时以解决3Sum问题

Question

我试图在给定的总和为零的整数集中找到所有唯一的三元组。我有以下代码，对我来说，这些代码在逻辑上可以正常工作，但是我一直收到超时错误。关于我所缺少的或如何优化的任何建议？我已经看了好几次了，我看不出如何更快地制作它。预先感谢！

class Solution:
def threeSum(self, nums):
    """
    :type nums: List[int]
    :rtype: List[List[int]]
    """
    nums.sort()
    for i in range(len(nums)-2):
        if i > 0 and nums[i] == nums[i-1]:
            continue

        target = 0 - nums[i]
        j = i +1
        k = len(nums) - 1
        tgt_sum = 0
        trpls = []

        while j < k:
            tgt_sum = nums[j] + nums[k]
            if tgt_sum == target:
                x = []
                x.append([i,j,k])
                if all(item in trpls for item in x) == True:
                    trpls_list.append([i,j,k])
            elif tgt_sum < target:
                j += 1
            elif tgt_sum > target:
                k -= 1
            else:
                k -= 1

test = Solution()
given_nums = [-1,0,1,2,-1,-4]
print(test.threeSum(given_nums))