129. Sum Root to Leaf Numbers(js)

129. Sum Root to Leaf Numbers

Given a binary tree containing digits from 0-9 only, each root-to-leaf path could represent a number.

An example is the root-to-leaf path 1->2->3 which represents the number 123.

Find the total sum of all root-to-leaf numbers.

Note: A leaf is a node with no children.

Example:

Input: [1,2,3]
    1
   / \
  2   3
Output: 25
Explanation:
The root-to-leaf path 1->2 represents the number 12.
The root-to-leaf path 1->3 represents the number 13.
Therefore, sum = 12 + 13 = 25.

Example 2:

Input: [4,9,0,5,1]
    4
   / \
  9   0
 / \
5   1
Output: 1026
Explanation:
The root-to-leaf path 4->9->5 represents the number 495.
The root-to-leaf path 4->9->1 represents the number 491.
The root-to-leaf path 4->0 represents the number 40.
Therefore, sum = 495 + 491 + 40 = 1026.
题意:给定一颗二叉树,求出树的每个分支从根节点到叶子节点组成的数字的和
代码如下:
/**
 * Definition for a binary tree node.
 * function TreeNode(val) {
 *     this.val = val;
 *     this.left = this.right = null;
 * }
 */
/**
 * @param {TreeNode} root
 * @return {number}
 */
var sumNumbers = function(root) {
    return helper(root,0);
};
var helper=function(node,sum){
    if(!node) return 0;
//     如果当前是无子节点的叶子节点,返回结果
    if(!node.left && !node.right) return sum*10+node.val;
    return helper(node.left,sum*10+node.val)+helper(node.right,sum*10+node.val);
}

 

posted @ 2019-05-25 20:16  mingL  阅读(170)  评论(0编辑  收藏  举报