forked from DaleStudy/leetcode-study
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathhyeri0903.py
More file actions
39 lines (32 loc) · 1.16 KB
/
hyeri0903.py
File metadata and controls
39 lines (32 loc) · 1.16 KB
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
28
29
30
31
32
33
34
35
36
37
38
39
from itertools import combinations
class Solution:
def threeSum(self, nums: List[int]) -> List[List[int]]:
"""
time complexity : O(n^2)
space complexity : O(1)
"""
answer = []
nums.sort()
n = len(nums)
for i in range(n):
#skipped if nums[i] == nums[i-1] to avoid duplicate triplets
if i > 0 and nums[i] == nums[i-1]:
continue
#search with two pointer
left, right = i+1, n-1
while left < right:
total = nums[left] + nums[i] + nums[right]
if total == 0:
answer.append([nums[left], nums[i], nums[right]])
#move the pointers past duplicates
while left < right and nums[left] == nums[left+1]:
left += 1
while left < right and nums[right] == nums[right-1]:
right -= 1
left += 1
right -= 1
elif total < 0:
left += 1
else:
right -= 1
return answer