forked from DaleStudy/leetcode-study
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathdevyejin.py
More file actions
36 lines (26 loc) · 1010 Bytes
/
devyejin.py
File metadata and controls
36 lines (26 loc) · 1010 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
27
28
29
30
31
32
33
34
35
36
class Solution:
def threeSum(self, nums: List[int]) -> List[List[int]]:
nums.sort() # O(n)
n = len(nums)
result = []
for i in range(n - 2):
# target을 잡을때도 이전에 구했다면 패스
if i > 0 and nums[i] == nums[i - 1]:
continue
target = - nums[i]
left, right = i + 1, n - 1
while left < right:
two_sum = nums[left] + nums[right]
if two_sum == target:
result.append([nums[i], nums[left], nums[right]])
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 two_sum < target:
left += 1
else:
right -= 1
return result