Skip to content

[paran22] Week 01 solutions #1141

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 4 commits into from
Apr 6, 2025
Merged

[paran22] Week 01 solutions #1141

Changes from 1 commit
Commits
Show all changes
4 commits
Select commit Hold shift + click to select a range
cc9a53d
contains duplicate solution
Mar 31, 2025
abfd7d9
two-sum solution
Apr 1, 2025
e7839d5
two-sum solution
Apr 1, 2025
97b92bf
two-sum solution
Apr 1, 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
4 changes: 4 additions & 0 deletions contains-duplicate/paran22.py
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,4 @@
class Solution:
def containsDuplicate(self, nums: List[int]) -> bool:
unique_nums = set(nums)
return len(unique_nums) != len(nums)
Copy link
Contributor

Choose a reason for hiding this comment

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

와우! 전 왜 이 방법을 생각 못했을까요?
set 으로 변환하면 중복된 값이 없어지고, length 가 줄어드니, 비교만하면 되는 것을...
Hashmap (Dictionary)를 이용해서 넣고 빼는 것과 비교해서 Time/Space Complexity 는 차이 없는데,
코드가 너무 깔끔하네요!
(근데, 코드 리뷰는 저를 넣으셔서 제가 일단 찾아 봤는데, 규칙상 paran22 님께서 제 코드 리뷰를 해주셔야 할 것 같아요. ㅎㅎ)

Copy link
Contributor Author

Choose a reason for hiding this comment

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

넵! 확인했습니다 🙇

Copy link
Contributor Author

Choose a reason for hiding this comment

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

제가 순서를 헷갈려서 리뷰어로 추가한 것 같아요 ㅜㅜ 리뷰 같이 진행해주셔서 감사합니다!!