-
-
Notifications
You must be signed in to change notification settings - Fork 193
[Tessa1217] Week 12 Solutions #1594
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
|
||
int end = intervals[0][1]; | ||
|
||
for (int i = 1; i < intervals.length; i++) { |
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.
안녕하세요 :) 12주차까지 꾸준히 하는거 대단하시네요!! 앞으로 남은기간도 화이팅 💯
사소한 디테일이지만 0이 아니라 1부터 시작하는거 좋은 것 같아요 ㅎㅎ
if (p == null && q == null) return true; | ||
if (p == null || q == null) return false; | ||
if (p.val != q.val) return false; | ||
return isSameTree(p.left, q.left) && isSameTree(p.right, q.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.
Queue 사용한 방식으로만 풀었는데 재귀를 사용하니까 가독성이 되게 좋네요 👍👍
return buildTree(queue); | ||
} | ||
|
||
private TreeNode buildTree(Queue<String> queue) { |
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.
저는 Queue 자체를 파라미터로 넘겨서 하는 방식이 생소해서 생각하지 못했는데 잘 구현하셨네요!
same-tree 문제도 그렇고 여기서도 dfs를 사용하시는게 익숙하신가보네요!
bfs로 풀어보시는 것도 좋을거 같아요 😄
답안 제출 문제
작성자 체크 리스트
In Review
로 설정해주세요.검토자 체크 리스트
Important
본인 답안 제출 뿐만 아니라 다른 분 PR 하나 이상을 반드시 검토를 해주셔야 합니다!