-
Notifications
You must be signed in to change notification settings - Fork 126
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 10 #1007
[KwonNayeon] Week 10 #1007
Conversation
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: numCourses, P: prerequisites의 길이 | ||
|
||
Space Complexity: O(N + P) | ||
- 세트의 메모리 사용량이 N과 비례하고 인접 리스트의 크기가 P |
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.
그리고 재귀 호출 스택의 깊이까지 언급해주면 더 좋을 것 같아요 :)
Space Complexity: | ||
- O(w): w는 트리의 최대 너비(width) | ||
|
||
풀이방법: |
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.
BFS 풀이 방법 좋네요 :)
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.
@obzva 님 리뷰 감사합니다! 리뷰해주신 것 참고해서 TC 설명 개선해보겠습니다. 남은 한주 파이팅입니다! 💪😁
답안 제출 문제
체크 리스트
In Review
로 설정해주세요.