Skip to content

[hestia-park] Week1 #1173

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

Closed
wants to merge 2 commits into from
Closed

[hestia-park] Week1 #1173

Changes from all commits
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
33de329
A solution for Contains Duplicate #217
hestia-park Apr 2, 2025
bcfdf69
add newline A solution for Contains Duplicate #217
hestia-park Apr 8, 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
5 changes: 5 additions & 0 deletions contains-duplicate/hestia-park.py
View file
Open in desktop
Copy link
Contributor

Choose a reason for hiding this comment

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

안녕하세요! 저도 파이썬으로 참여 중인데, 집합을 사용해서 길이 비교로 중복 여부를 체크하는 알고리즘이 간단하고 명확해서 좋습니다. 새롭게 배워갑니다. ✍️
마지막 개행문자 추가만 해주시면 될 것 같습니다!

Original file line number Diff line number Diff line change
@@ -0,0 +1,5 @@
class Solution:
def containsDuplicate(self, nums: List[int]) -> bool:
return len(nums) != len(set(nums))