-
-
Notifications
You must be signed in to change notification settings - Fork 195
[KwonNayeon] Week 2 solutions #1207
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
@@ -40,3 +41,11 @@ def validate(node, min_val, max_val): | |||
|
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.
left 트리와 right 트리의 결과를 and 해서 return 하는 코드 깔끔하네요
저는 각각 비교했는데 더 짧고 간결해져서 좋네요
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.
왼쪽에서 오른쪽으로 오른쪽에서 왼쪽으로 누적곱을 이용하는 방법 좋네요
@PDKhan 님 리뷰 감사합니다! 2주차도 화이팅입니다 👍 |
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 하나 이상을 반드시 검토를 해주셔야 합니다!