-
-
Notifications
You must be signed in to change notification settings - Fork 195
[PDKhan] WEEK 02 solutions #1208
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.
전체적으로 깔끔하게 잘 푸신 것 같아요..! 고생하셨습니다
while(left < right && nums[left] == nums[left-1]) | ||
left++; | ||
|
||
while(left < right && nums[right] == nums[right+1]) | ||
right--; |
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.
전 set을 사용해서 중복을 제거했는데 이런 방법으로도 할 수 있네요! 한 수 배워갑니다
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(root->val <= min || root->val >= max) | ||
return false; | ||
|
||
return search(root->left, min, root->val) && search(root->right, root->val, max); |
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.
처음에는 left 따로 right 따로 리턴 값 체크했는데 하나로 합치는게 더 깔끔해보이더라고요
감사합니다.
답안 제출 문제
작성자 체크 리스트
In Review
로 설정해주세요.검토자 체크 리스트
Important
본인 답안 제출 뿐만 아니라 다른 분 PR 하나 이상을 반드시 검토를 해주셔야 합니다!