-
Notifications
You must be signed in to change notification settings - Fork 0
/
sum.py
27 lines (23 loc) · 829 Bytes
/
sum.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
from typing import List
class Solution:
def threeSum(self, nums: List[int]) -> List[List[int]]:
if len(nums) < 3:
return []
sol = set()
nums = sorted(nums)
for i in range(len(nums)-2):
j = i+1
k = len(nums)-1
while j < k:
while nums[i] + nums[j] + nums[k] > 0:
if i == j or j == k or i == k:
break
k -= 1
while nums[i] + nums[j] + nums[k] < 0:
if i == j or j == k or i == k:
break
j += 1
if nums[i] + nums[j] + nums[k] == 0 and i != j != k:
sol.add(tuple(sorted([nums[i], nums[j], nums[k]])))
j += 1
return list(sol)