-
Notifications
You must be signed in to change notification settings - Fork 3
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
Ksg2388 : [19week] #116
base: main
Are you sure you want to change the base?
Ksg2388 : [19week] #116
Conversation
ksg2388
commented
Jul 12, 2023
- 귀여운 라이언
- 시간 복잡도 :
$O(N)$
- 가장 가까운 공통 조상
- 시간 복잡도 :
$O(NlogN)$
- 개근상
- 시간 복잡도 :
$O(N)$
- 풍선 터트리기
- 시간 복잡도 :
$O(N)$
- 호텔 대실
- 시간 복잡도 :
$O(N^2)$
|
||
## :pushpin: **Algorithm** | ||
|
||
구현, 메모이제이션 |
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.
DP 공부 다시 하세요.
|
||
- 예전에 비슷한 문제를 풀어서 우선순위 큐를 이용해야겠다고 생각했다. | ||
- 문자열이 정렬이 되지 않아서 일일히 분을 시간으로 치환해서 정렬을 했다. | ||
- 문자열을 다루는데 시간을 너무 잡아먹은 것 같다... |
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.
문자열에 강해져야겠네요 ㅎ 비중을 늘려봅시다