update: 129

Author: hijiangtao

README.md

@@ -88,6 +88,7 @@ This is the solutions collection of my LeetCode submissions, most of them are pr
 | 123 | [Best Time to Buy and Sell Stock III](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-iii/) <sup>*</sup> | [JavaScript](./src/best-time-to-buy-and-sell-stock-iii/res.js) | Hard |
 | 127 | [Word Ladder](https://leetcode.com/problems/word-ladder/) | [JavaScript](./src/word-ladder/res.js) | Medium |
 | 128 | [Longest Consecutive Sequence](https://leetcode.com/problems/longest-consecutive-sequence/) | [JavaScript](./src/longest-consecutive-sequence/res.js) | Medium |
+| 129 | [sum-root-to-leaf-numbers](https://leetcode.com/problems/sum-root-to-leaf-numbers/) | [TypeScript](./src/sum-root-to-leaf-numbers/res.ts) | Medium |
 | 130 | [Surrounded Regions](https://leetcode.com/problems/surrounded-regions/) | [JavaScript](./src/surrounded-regions/res.js) | Medium |
 | 131 | [palindrome-partitioning](https://leetcode.com/problems/palindrome-partitioning/) | [TypeScript](./src/palindrome-partitioning/res.ts) | Medium |
 | 133 | [Clone Graph](https://leetcode.com/problems/clone-graph/) | [JavaScript](./src/clone-graph/res.js) | Medium |

src/sum-root-to-leaf-numbers/res.ts

@@ -0,0 +1,35 @@
+/**
+* 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 {
+const result: number[][] = [];
+
+const dfs = (root: TreeNode | null, nums: number[]) => {
+if (!root) {
+return ;
+}
+
+if (!root.left && !root.right) {
+result.push([...nums, root.val]);
+return ;
+}
+
+dfs(root.left, [...nums, root.val]);
+dfs(root.right, [...nums, root.val]);
+}
+
+dfs(root, []);
+
+return result.map(item => parseInt(item.join(''))).reduce((a, b) => a + b);
+};