feat(1022): 递归&进制

descire · descire · commit bc70deef950b · 2022-05-30T23:52:19.000+08:00
diff --git a/Binary-Tree/1022/solution1.js b/Binary-Tree/1022/solution1.js
@@ -5,18 +5,19 @@
  */
 const sumRootToLeaf = root => {
   let sum = 0;
-  const help = (root, path) => {
+  const dfs = (root, path) => {
     if (!root) {
       return;
     }
-    const newPath = path + '' + root.val;
+    path += String(root.val);
     if (!root.left && !root.right) {
-      sum += Number.parseInt(newPath, 2);
+      sum += Number.parseInt(path, 2);
+      return;
     }
-    help(root.left, newPath);
-    help(root.right, newPath);
-  }
 
-  help(root, '');
+    dfs(root.left, path);
+    dfs(root.right, path);
+  }
+  dfs(root, '');
   return sum;
 }
