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