【LeetCode】 129. Sum Root to Leaf Numbers 求根到叶子节点数字之和（Medium）（JAVA）

【LeetCode】 129. Sum Root to Leaf Numbers 求根到叶子节点数字之和（Medium）（JAVA）

题目地址: https://leetcode.com/problems/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.

题目大意

给定一个二叉树，它的每个结点都存放一个 0-9 的数字，每条从根到叶子节点的路径都代表一个数字。

例如，从根到叶子节点路径 1->2->3 代表数字 123。

计算从根到叶子节点生成的所有数字之和。

说明: 叶子节点是指没有子节点的节点

解题方法

这一题主要要理解叶子节点的含义：没有子节点的节点（左右子节点都没有）

通过迭代，不断累加所有的到叶子节点的和即可

class Solution {
    int sum = 0;
    public int sumNumbers(TreeNode root) {
        sumH(root, 0);
        return sum;
    }

    public void sumH(TreeNode root, int pre) {
        if (root == null) return;
        pre = pre * 10 + root.val;
        if (root.left == null && root.right == null) {
            sum += pre;
        }
        sumH(root.left, pre);
        sumH(root.right, pre);
    }
}

执行耗时:0 ms,击败了100.00% 的Java用户
内存消耗:35.6 MB,击败了99.89% 的Java用户

欢迎关注我的公众号，LeetCode 每日一题更新