-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy path3sum.py
More file actions
26 lines (22 loc) · 744 Bytes
/
Copy path3sum.py
File metadata and controls
26 lines (22 loc) · 744 Bytes
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
class Solution:
def threeSum(self, nums: List[int]) -> List[List[int]]:
nums.sort()
result = []
for i in range(len(nums) - 2):
if i > 0 and nums[i] == nums[i-1]:
continue
l, r = i + 1, len(nums) - 1
target = -nums[i]
while l < r:
total = nums[l] + nums[r]
if total < target:
l += 1
elif total > target:
r -= 1
else:
result.append([nums[l], nums[r], nums[i]])
l += 1
while nums[l] == nums[l-1] and l < r:
l += 1
r -= 1
return result