-
-
Notifications
You must be signed in to change notification settings - Fork 244
[hyer0705] Week 12 solution #1937
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
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.
안녕하세요. 주말동안 감기몸살로 앓아서 늦게 리뷰 다는 점 죄송합니다.
가능하면 시간 복잡도,공간복잡도도 같이 적어주시면 좋을 것 같습니다.
(달래스터디에도 써있는 내용입니다)
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.
5문제 모두 푸느라 고생 많으셨습니다
* @param n: the number of vertices | ||
* @param edges: the edges of undirected graph | ||
* @return: the number of connected components |
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.
세심하게 변수에 대한 설명을 적어놓으신 게 인상 깊습니다.
if (!p && !q) return true; | ||
if (!p || !q) return false; |
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.
타입스크립트 문법은 신기하네요. 첫번째는 둘 다 null인지 확인하는 부분, 두번째는 한쪽만 null인지 확인하는 if조건문 맞죠?
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.
넵 맞습니다~
답안 제출 문제
작성자 체크 리스트
In Review
로 설정해주세요.검토자 체크 리스트
Important
본인 답안 제출 뿐만 아니라 다른 분 PR 하나 이상을 반드시 검토를 해주셔야 합니다!