fyb/neetcode
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

2p? solution using sets

Browse Source
This commit is contained in:
yigid balaban 2024-09-13 10:21:20 +03:00
parent 5f98d05a8e
commit 07b46554a3
Signed by: fyb
GPG Key ID: E21FEB2C244CB7EB
1 changed files with 21 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

22
medium/3sum.py
View File

@ -3,7 +3,7 @@
# neetcode 2024
# 3sum
def solution(nums: list[int]) -> list[list[int]]:
def solution0(nums: list[int]) -> list[list[int]]:
if len(nums) < 3:
return []
if len(nums) == 3 and sum(nums) == 0:
@ -25,6 +25,26 @@ def solution(nums: list[int]) -> list[list[int]]:
triples.extend(comb(nums[p + 1:], nums[p]))
return triples
def solution(nums: list[int]) -> list[list[int]]:
if len(nums) < 3:
return []
if len(nums) == 3:
if sum(nums) == 0: return [nums]
else: return []
r = []
s = []
for p0 in range(len(nums)):
for p1 in range(p0 + 1, len(nums)):
inverse = -1 * (nums[p0] + nums[p1])
if inverse in set(nums[p1+1:]) and set({nums[p0], nums[p1], inverse}) not in s:
r.append([nums[p0], nums[p1], inverse])
s.append({nums[p0], nums[p1], inverse})
return list(map(lambda ss: list(ss), r))
print(solution([0,0]) == [])
print(solution([-1,0,1,2,-1,-4]), solution([-1,0,1,2,-1,-4]) == [[-1,-1,2],[-1,0,1]])
print(solution([0,1,1]) == [])