-
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
[재호] WEEK 10 Solutions #530
Conversation
* 모든 트리를 순회합니다. | ||
* | ||
* SC: O(N) | ||
* 최악의 경우 (한쪽으로 치우친 트리) N만큼 CallStack이 생깁니다. |
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.
트리의 높이 H로 공간 복잡도를 설명하는 것도 괜찮은 방법일 것 같습니다 :)
@@ -0,0 +1,65 @@ | |||
/** | |||
* 모든 케이스가 많지 않다고 생각되어 분기처리하였습니다.. |
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.
@wogha95 님 하나씩 직접 풀어내시는 모습 정말 멋지고 보기좋네요!
지난 주 고생 많으셨고, 이번 주도 화이팅입니다~!
} else { | ||
right = center; | ||
} | ||
} |
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.
직접 하나씩 분기처리하여 답을 찾아내신점 정말 멋집니다!
아래는 중요하지 않은 내용입니다
53-61라인의 경우에도 37-44, 45-52라인과 같이 대칭성을 맞춰주셨다면 조금 더 좋았을것같네요!
답안 제출 문제
체크 리스트
In Review
로 설정해주세요.