题目
解法1:hash table + sort triplets
这解法T了,应该是T在遍历之前储存的pair那边。不过我个人感觉这种做法比较直观
class Solution:
def threeSum(self, nums: List[int]) -> List[List[int]]:
pairs = collections.defaultdict(list)
n = len(nums)
ans = set()
for i in range(n):
for j in range(i+1,n):
pairs[nums[i]+nums[j]].append((i,j))
for i in range(n):
if (0-nums[i