Skip to content

[jiunshinn] WEEK01 solutions #1692

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
merged 5 commits into from
Jul 28, 2025
Merged

[jiunshinn] WEEK01 solutions #1692

Changes from 1 commit
Commits
Show all changes
5 commits
Select commit Hold shift + click to select a range
6fd573f
contains duplicate solution
jiunshinn Jul 21, 2025
142dbf2
add new lines
jiunshinn Jul 21, 2025
af8f483
file name change
jiunshinn Jul 21, 2025
8f7a714
풀이법 추가
jiunshinn Jul 21, 2025
c1c5103
two sum solution
jiunshinn Jul 22, 2025
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
12 changes: 12 additions & 0 deletions two-sum/jiunshinn.py
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,12 @@
# time complexity : o(n)
# space complexity : o(n)
class Solution:
def twoSum(self, nums: List[int], target: int) -> List[int]:
hashmap = {}

for i, n in enumerate(nums):
diff = target - n
if diff in hashmap:
return [i, hashmap[diff]]
Copy link
Contributor

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

리턴 시 인덱스 순서가 문제 요구사항과 맞지 않을 수 있으므로 return [i, hashmap[diff]] 대신 return [hashmap[diff], i]로 수정하는 것이 안전합니다.

else:
hashmap[n] = i