python递归法 更快

python递归法 更快
This commit is contained in:
ORain
2021-11-29 18:51:29 +08:00
committed by GitHub
parent 126a62dbba
commit 997ffb1061

View File

@ -256,6 +256,23 @@ class Solution {
## Python
```python
class Solution:
"""递归法 更快"""
def constructMaximumBinaryTree(self, nums: List[int]) -> TreeNode:
if not nums:
return None
maxvalue = max(nums)
index = nums.index(maxvalue)
root = TreeNode(maxvalue)
left = nums[:index]
right = nums[index + 1:]
root.left = self.constructMaximumBinaryTree(left)
root.right = self.constructMaximumBinaryTree(right)
return root
class Solution:
"""最大二叉树 递归法"""