-
-
Notifications
You must be signed in to change notification settings - Fork 195
[혜준] Week5 문제 풀이 #452
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
[혜준] Week5 문제 풀이 #452
Conversation
group-anagrams/hyejjun.js
Outdated
/* | ||
시간 복잡도: O(n*k log k) | ||
공간 복잡도: O(n*k) | ||
*/ |
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.
안녕하세요 혜준님!
시간, 공간 복잡도를 이야기할 때 n이나 k가 무엇을 가리키는지 명시하면 더 알고리즘을 이해하기 수월할 것 같아요.
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.
오... 각 값을 정렬 후 각 key, value값으로 사용 하니 이렇게 간단히 풀리는군요.
Array.from() 도 처음보네요.
공부가 되었습니다 고생하셨습니다!
group-anagrams/hyejjun.js
Outdated
/* | ||
시간 복잡도: O(n*k log k) | ||
공간 복잡도: O(n*k) | ||
*/ |
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.
오... 각 값을 정렬 후 각 key, value값으로 사용 하니 이렇게 간단히 풀리는군요.
Array.from() 도 처음보네요.
공부가 되었습니다 고생하셨습니다!
답안 제출 문제
체크 리스트
In Review
로 설정해주세요.