-
-
Notifications
You must be signed in to change notification settings - Fork 247
[chordpli] WEEK 04 solutions #1832
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
feat: 1주차 1,2 문제
* feat: 242 문제 * feat: 70 문제 * feat: leetcode / 15 / success / 투포인터
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.
파이썬 코드도 리스트 노드도 되게 오랜만에 접하는데 확실히 파이썬의 가독성이 훨씬 나은 거 같네요. 수고하셨습니다!
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.
max(right, left)로 root를 주면 어떻게 되나요? 자바스크립트에서는 노드끼리 비교가 되지 않았던 거 같았어요.
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.
원하시는 답변인지는 모르겠으나, 노드끼리 비교할경우 val까지 확인해야 비교가 되는 것 같습니다!
root.left = TreeNode(9)
root.right = TreeNode(9)
print(root.left.val == root.right.val) True
print(root.left == root.right) False
답안 제출 문제
작성자 체크 리스트
In Review
로 설정해주세요.검토자 체크 리스트
Important
본인 답안 제출 뿐만 아니라 다른 분 PR 하나 이상을 반드시 검토를 해주셔야 합니다!