diff --git a/problems/0129.求根到叶子节点数字之和.md b/problems/0129.求根到叶子节点数字之和.md
index a330991e..7f50c885 100644
--- a/problems/0129.求根到叶子节点数字之和.md
+++ b/problems/0129.求根到叶子节点数字之和.md
@@ -168,7 +168,6 @@ Java：
 class Solution {
     List<Integer> path = new ArrayList<>();
     int res = 0;
-
     public int sumNumbers(TreeNode root) {
         // 如果节点为0，那么就返回0
         if (root == null) return 0;
@@ -200,7 +199,6 @@ class Solution {
         }
         return;
     }
-
     public int listToInt(List<Integer> path){
         int sum = 0;
         for (Integer num:path){