3 sum系列属于two sum的后续拓展问题,感兴趣可以移步之前的two sum总结篇。
初入门的朋友们可以一起打卡哦~
【15. 3Sum】
题干:input是一个array,取其中三个数保证 nums[i] + nums[j] + nums[k] == 0 且满足i, j, k互不相等,也就是一个数不能用两次。
建议:先做【167.Two Sum II - Input Array Is Sorted】和【1099. Two Sum Less Than K】
解法:
1. brute force: 延续two sum最简单的解法,可以用三个loop来找。这里就不写码了。
- time complexity: O(n^3), n is the length of the array
- space complexity: O(1)
2. hash table: 变成一个loop里面➕ two sum中hash table的解法
- time complexity: O(n^2), n is the length of the array
- space complexity: O(n)
class Solution:
def threeSum(self, nums: List[int]) -> List[List[int]]:
res = []
nums = sorted(nums)
for i, v in enumerate(nums):
if v > 0:
break
if i == 0 or v != nums[i-1]:
visit = set()
for j in range(i+1, len(nums)):
if j+1< len(nums) and nums[j] == nums[j+1]:
visit.add(nums[j])
continue
diff = -v-nums[j]
if diff in visit:
res.append([v,diff, nums[j]])
visit.add(nums[j])
return res