Thanks to visit codestin.com Credit goes to github.com
We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
2 parents 3022a1b + 33bd68f commit 4899deeCopy full SHA for 4899dee
3-linear-data-structures/ch07/9-1.py
@@ -18,6 +18,6 @@ def threeSum(self, nums: List[int]) -> List[List[int]]:
18
if k > j + 1 and nums[k] == nums[k - 1]:
19
continue
20
if nums[i] + nums[j] + nums[k] == 0:
21
- results.append((nums[i], nums[j], nums[k]))
+ results.append([nums[i], nums[j], nums[k]])
22
23
return results
3-linear-data-structures/ch07/9-2.py
@@ -21,7 +21,7 @@ def threeSum(self, nums: List[int]) -> List[List[int]]:
right -= 1
else:
# `sum = 0`인 경우이므로 정답 및 스킵 처리
24
- results.append((nums[i], nums[left], nums[right]))
+ results.append([nums[i], nums[left], nums[right]])
25
26
while left < right and nums[left] == nums[left + 1]:
27
left += 1
0 commit comments