feat: add typescript solution to lc problem: No.0129

No.0129.Sum Root to Leaf Numbers

Co-authored-by: zhaocchen <zhaocchen@163.com>

Author: yanglbme

solution/0100-0199/0129.Sum Root to Leaf Numbers/README.md

@@ -126,6 +126,35 @@ class Solution {
 }
 ```
 
+### **TypeScript**
+
+```ts
+/**
+ * Definition for a binary tree node.
+ * class TreeNode {
+ *     val: number
+ *     left: TreeNode | null
+ *     right: TreeNode | null
+ *     constructor(val?: number, left?: TreeNode | null, right?: TreeNode | null) {
+ *         this.val = (val===undefined ? 0 : val)
+ *         this.left = (left===undefined ? null : left)
+ *         this.right = (right===undefined ? null : right)
+ *     }
+ * }
+ */
+
+function sumNumbers(root: TreeNode | null): number {
+    return dfs(root);
+};
+
+function dfs(root: TreeNode | null, preSum : number = 0): number {
+    if (!root) return 0;
+    preSum = preSum * 10 + root.val;
+    if (!root.left && !root.right) return preSum;
+    return dfs(root.left, preSum) + dfs(root.right, preSum);
+}
+```
+
 ### **C++**
 
 ```cpp

solution/0100-0199/0129.Sum Root to Leaf Numbers/README_EN.md

@@ -114,6 +114,35 @@ class Solution {
 }
 ```
 
+### **TypeScript**
+
+```ts
+/**
+ * Definition for a binary tree node.
+ * class TreeNode {
+ *     val: number
+ *     left: TreeNode | null
+ *     right: TreeNode | null
+ *     constructor(val?: number, left?: TreeNode | null, right?: TreeNode | null) {
+ *         this.val = (val===undefined ? 0 : val)
+ *         this.left = (left===undefined ? null : left)
+ *         this.right = (right===undefined ? null : right)
+ *     }
+ * }
+ */
+
+function sumNumbers(root: TreeNode | null): number {
+    return dfs(root);
+};
+
+function dfs(root: TreeNode | null, preSum : number = 0): number {
+    if (!root) return 0;
+    preSum = preSum * 10 + root.val;
+    if (!root.left && !root.right) return preSum;
+    return dfs(root.left, preSum) + dfs(root.right, preSum);
+}
+```
+
 ### **C++**
 
 ```cpp

solution/0100-0199/0129.Sum Root to Leaf Numbers/Solution.ts

@@ -0,0 +1,24 @@
+/**
+ * Definition for a binary tree node.
+ * class TreeNode {
+ *     val: number
+ *     left: TreeNode | null
+ *     right: TreeNode | null
+ *     constructor(val?: number, left?: TreeNode | null, right?: TreeNode | null) {
+ *         this.val = (val===undefined ? 0 : val)
+ *         this.left = (left===undefined ? null : left)
+ *         this.right = (right===undefined ? null : right)
+ *     }
+ * }
+ */
+
+ function sumNumbers(root: TreeNode | null): number {
+    return dfs(root);
+};
+
+function dfs(root: TreeNode | null, preSum : number = 0): number {
+    if (!root) return 0;
+    preSum = preSum * 10 + root.val;
+    if (!root.left && !root.right) return preSum;
+    return dfs(root.left, preSum) + dfs(root.right, preSum);
+}