Lowest Common Ancestor Of A Binary Search Tree#75
Open
Yuto729 wants to merge 2 commits into
Open
Conversation
|
|
||
| found_p_left, found_q_left = dfs(node.left) | ||
| found_p_right, found_q_right = dfs(node.right) | ||
| found_p = found_p_left or found_p_right or node == p |
There was a problem hiding this comment.
==よりもisを使った方が良さそうです。TreeNodeの__eq__がnode.valで見る実装が存在しても不思議ではなので
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
2 participants
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
解く問題
Lowest Common Ancestor Of A Binary Search Tree
次に解く問題
Insert Interval