algorithm/leetcode-master
1
0
Fork 0
mirror of https://github.com/youngyangyang04/leetcode-master.git synced 2025-07-12 05:20:59 +08:00
Code Issues Packages Projects Releases Wiki Activity

Update 0654.最大二叉树.md

Browse Source
This commit is contained in:
jianghongcheng
2023-05-22 21:48:07 -05:00
committed by GitHub
parent 1ac1a8c332
commit 12634b2d89
1 changed files with 4 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files

5
problems/0654.最大二叉树.md
View File

@ -292,6 +292,8 @@ class Solution:
``` ```
(版本二) 使用下标 (版本二) 使用下标
```python
class Solution: class Solution:
def traversal(self, nums: List[int], left: int, right: int) -> TreeNode: def traversal(self, nums: List[int], left: int, right: int) -> TreeNode:
if left >= right: if left >= right:
@ -309,7 +311,8 @@ class Solution:
return self.traversal(nums, 0, len(nums)) return self.traversal(nums, 0, len(nums))
``` ```python
(版本三) 使用切片 (版本三) 使用切片
class Solution: class Solution:
def constructMaximumBinaryTree(self, nums: List[int]) -> TreeNode: def constructMaximumBinaryTree(self, nums: List[int]) -> TreeNode: