108. Convert Sorted Array to Binary Search Tree #15
+113
−0
Conversation
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
modify KaTeX reps
tokuhirat
reviewed
Jul 27, 2025
| return root | ||
|
|
||
| return helper(0, len(nums) - 1) | ||
| ``` |
tokuhirat
reviewed
Jul 27, 2025
| - C++ | ||
| - DFS | ||
| * `TreeNode`の `left` と `right` 、配列インデックスの `left` と `right` で一瞬混乱してしまう | ||
| - 後者を `left_i` 、 `right_i` とするのもあり？ |
|
いいと思いました。 |
ryosuketc
reviewed
Jul 28, 2025
| ```py | ||
| class Solution: | ||
| def sortedArrayToBST(self, nums: List[int]) -> Optional[TreeNode]: | ||
| def helper(left, right): |
There was a problem hiding this comment.
あまり外部での利用を想定していないのでよいかもしれませんが、sorted_array_to_bst_helper くらいの名前でもよいのかなと思いました。
| root = TreeNode(nums[mid]) | ||
|
|
||
| root.left = self.sortedArrayToBST(nums[:mid]) | ||
| root.right = self.sortedArrayToBST(nums[mid+1:]) |
There was a problem hiding this comment.
root.right = self.sortedArrayToBST(nums[mid + 1:])とスライスのところスペースを開けるべきかとおもったのですがこのあたり全部許容なんですね。
https://peps.python.org/pep-0008/#pet-peeves
# Correct:
ham[1:9], ham[1:9:3], ham[:9:3], ham[1::3], ham[1:9:]
ham[lower:upper], ham[lower:upper:], ham[lower::step]
ham[lower+offset : upper+offset]
ham[: upper_fn(x) : step_fn(x)], ham[:: step_fn(x)]
ham[lower + offset : upper + offset]
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
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.
108. Convert Sorted Array to Binary Search Tree
次回予告: 111. Minimum Depth of Binary Tree