| from typing import List | |
| class Solution: | |
| def threeSum(self, nums: List[int]) -> List[List[int]]: | |
| nums.sort() | |
| res = [] | |
| for i in range(len(nums) - 2): | |
| if nums[i] > 0: | |
| break | |
| if i > 0 and nums[i] == nums[i - 1]: | |
| continue | |
| j, k = i + 1, len(nums) - 1 | |
| while j < k: | |
| s = nums[i] + nums[j] + nums[k] | |
| if s == 0: | |
| res.append([nums[i], nums[j], nums[k]]) | |
| j += 1 | |
| k -= 1 | |
| while j < k and nums[j] == nums[j - 1]: | |
| j += 1 | |
| while j < k and nums[k] == nums[k + 1]: | |
| k -= 1 | |
| elif s > 0: | |
| k -= 1 | |
| while j < k and nums[k] == nums[k + 1]: | |
| k -= 1 | |
| else: | |
| j += 1 | |
| while j < k and nums[j] == nums[j - 1]: | |
| j += 1 | |
| return res | |