Update 0654.最大二叉树.md

problems/0654.最大二叉树.md

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