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.
1 parent dcfe111 commit 82defaeCopy full SHA for 82defae
14. Questions/leetcode 15 - three sum.py
@@ -0,0 +1,29 @@
1
+# three sum | leetcode 15 | https://leetcode.com/problems/3sum/
2
+# - sorted; nested loop; outer loop for first element
3
+# - inner loop for two sum on rest of list
4
+# - avoid duplicates by shifting window till last occurrence
5
+
6
+class Solution:
7
+ def threeSum(self, nums: list[int]) -> list[list[int]]:
8
+ nums.sort()
9
+ N = len(nums)
10
+ triplets = []
11
+ for i in range(N):
12
+ if i > 0 and nums[i] == nums[i - 1]:
13
+ continue
14
15
+ ptrL = i + 1
16
+ ptrR = N - 1
17
+ while ptrL < ptrR:
18
+ s = nums[i] + nums[ptrL] + nums[ptrR]
19
+ if s > 0:
20
+ ptrR -= 1
21
+ elif s < 0:
22
+ ptrL += 1
23
+ else:
24
+ triplets.append([nums[i], nums[ptrL], nums[ptrR]])
25
26
+ while nums[ptrL] == nums[ptrL - 1] and ptrL < ptrR:
27
28
29
+ return triplets
AltStyle によって変換されたページ (->オリジナル) / アドレス: モード: デフォルト 音声ブラウザ ルビ付き 配色反転 文字拡大 モバイル
0 commit comments