diff --git a/problems/0654.最大二叉树.md b/problems/0654.最大二叉树.md
index 224e75e4..07fbeb82 100644
--- a/problems/0654.最大二叉树.md
+++ b/problems/0654.最大二叉树.md
@@ -292,6 +292,8 @@ class Solution:
         
 ```
 (版本二) 使用下标 
+```python
+
 class Solution:
     def traversal(self, nums: List[int], left: int, right: int) -> TreeNode:
         if left >= right:
@@ -309,7 +311,8 @@ class Solution:
         return self.traversal(nums, 0, len(nums))
 
         
-```
+```python
+
 (版本三) 使用切片
 class Solution:
     def constructMaximumBinaryTree(self, nums: List[int]) -> TreeNode: