-
-
Notifications
You must be signed in to change notification settings - Fork 195
[mandoolala] WEEK 2 solutions #1323
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.
고생 많으셨습니다!
return False | ||
return traverse(node.left, low, node.val) and traverse(node.right, node.val, high) | ||
|
||
return traverse(root, float("-inf"), float("inf")) |
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.
오... float("-inf"), float("inf")
는 각각 무슨 의미인지 궁금합니다!
def productExceptSelf(self, nums: List[int]) -> List[int]: | ||
answer = [1] * len(nums) | ||
left_product = 1 | ||
for i in range(len(nums) - 1): |
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.
(이미 충분히 빠른 코드이지만) 첫 번째 for 루프에서 0의 갯수를 세어 2개 이상인 경우 바로 0 배열을 반환하면 더욱 빠른 코드가 될 것 같습니다!
답안 제출 문제
작성자 체크 리스트
In Review
로 설정해주세요.검토자 체크 리스트
Important
본인 답안 제출 뿐만 아니라 다른 분 PR 하나 이상을 반드시 검토를 해주셔야 합니다!