Merge pull request #919 from ORainn/patch-2

python递归法 更快

problems/0654.最大二叉树.md

@@ -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:
     """最大二叉树 递归法"""