[riveroverflows] WEEK 01 Solutions#2362
Merged
riveroverflows merged 4 commits intoDaleStudy:mainfrom Mar 7, 2026
Merged
Conversation
- contains duplicate 풀이 과정 추가
hyeri0903
reviewed
Mar 6, 2026
| - 종합: O(n). | ||
| """ | ||
| def topKFrequent(self, nums: List[int], k: int) -> List[int]: | ||
| counts = dict() |
Contributor
There was a problem hiding this comment.
이 부분을 Counter 을 사용하면 더 간결하게 작성할 수 있을것 같습니다~
from collections import Counter
counts = Counter(nums)
Contributor
Author
There was a problem hiding this comment.
동의합니다!
주언어가 java/kotlin인데 python으로만 문제를 풀다보니 주언어로는 전혀 못 풀겠더라구요
그래서 최대한 풀어서 작성해보는 연습을 하고 있었습니다 ㅎㅎ
리뷰 감사합니다!
hyeri0903
approved these changes
Mar 6, 2026
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
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
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.
답안 제출 문제
작성자 체크 리스트
In Review로 설정해주세요.검토자 체크 리스트
Important
본인 답안 제출 뿐만 아니라 다른 분 PR 하나 이상을 반드시 검토를 해주셔야 합니다!