-
-
Notifications
You must be signed in to change notification settings - Fork 195
[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.
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
Changes from all commits
Commits
Show all changes
4 commits
Select commit
Hold shift + click to select a range
File filter
Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
There are no files selected for viewing
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
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) | ||
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,10 @@ | ||
class Solution: | ||
# 시간복잡도 : O(n) | ||
def twoSum(self, nums: List[int], target: int) -> List[int]: | ||
num_dict = {num: i for i, num in enumerate(nums)} | ||
|
||
for i, first_num in enumerate(nums): | ||
second_num = target - first_num | ||
if second_num in num_dict and num_dict[second_num] != i: | ||
return [i, num_dict[second_num]] | ||
|
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
There was a problem hiding this comment.
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 님께서 제 코드 리뷰를 해주셔야 할 것 같아요. ㅎㅎ)
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
넵! 확인했습니다 🙇
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
제가 순서를 헷갈려서 리뷰어로 추가한 것 같아요 ㅜㅜ 리뷰 같이 진행해주셔서 감사합니다!!