Skip to content

[pull] master from youngyangyang04:master #434

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.

Sign up for GitHub

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

Merged
merged 2 commits into from
Apr 21, 2024
Merged

[pull] master from youngyangyang04:master #434

Changes from all commits
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
ee99a72
feat(problem): 更新0108.将有序数组转换为二叉搜索树。添加了Python递归的精简版，自身调用
heystone999 Mar 30, 2024
9287b4d
Merge pull request #2502 from heystone999/master
youngyangyang04 Apr 21, 2024
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
12 changes: 12 additions & 0 deletions problems/0108.将有序数组转换为二叉搜索树.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -334,6 +334,18 @@ class Solution:
return root

```
递归 精简(自身调用)
```python
class Solution:
def sortedArrayToBST(self, nums: List[int]) -> Optional[TreeNode]:
if not nums:
return
mid = len(nums) // 2
root = TreeNode(nums[mid])
root.left = self.sortedArrayToBST(nums[:mid])
root.right = self.sortedArrayToBST(nums[mid + 1 :])
return root
```

迭代法
```python
Expand Down