-
-
Notifications
You must be signed in to change notification settings - Fork 195
[KwonNayeon] Week 1 #656
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
[KwonNayeon] Week 1 #656
Conversation
frequency[num] += 1 | ||
else: | ||
frequency[num] = 1 | ||
sorted_frequency = sorted(frequency.items(), key=lambda x: x[1], reverse=True) |
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.
잘 풀어주신 것 같습니다. 이후 문제에서 등장하는 시간복잡도 O(nlogk)를 만족하려면 어떤 방법이 필요할지 고민해보시면 좋을 것 같습니다! 전체 데이터가 다 필요한가에 대해서 고민해보면 해답을 떠올리실 수 있을 것 같습니다! (계속 정렬 상태를 유지하면 어떨까요?)
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.
리뷰 감사합니다! 말씀해주신 것 참고하여 다시 풀어보겠습니다 😁
@DaleStudy/coach @y00eunji 코치님, 리뷰어님 안녕하세요. 코드 승인 부탁드립니다! |
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.
이번주도 고생많으셨습니다!! 깔끔한 설명과 풀이 잘 보았습니다 ㅎㅎ
@SamTheKorean 코드 승인 감사합니다 😊 |
답안 제출 문제
체크 리스트
In Review
로 설정해주세요.