Sum Root to Leaf Numbers

最新推荐文章于 2022-04-08 10:01:02 发布

千寻221

最新推荐文章于 2022-04-08 10:01:02 发布

阅读量481

点赞数

分类专栏： LeetCode 文章标签： LeetCode 树递归 Java

本文链接：https://blog.csdn.net/u010378705/article/details/28302763

版权

LeetCode 专栏收录该内容

150 篇文章 0 订阅

订阅专栏

题目

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.

For example,
    1
   / \
  2   3
The root-to-leaf path 1->2 represents the number 12.
The root-to-leaf path 1->3 represents the number 13.

Return the sum = 12 + 13 = 25.

方法

使用树的先序遍历进行递归，终止条件是左右子树均为空，递归函数中，传递了一个临时值，表示到目前为止的值。

public class Solution {
	private int sum;
	private void preOrder(TreeNode node, int temp) {
		if (node != null) {
			temp = temp * 10 + node.val;
			if (node.left == null && node.right == null) {
				sum += temp;
			}
			preOrder(node.left, temp);
			preOrder(node.right, temp);
		}
	}

	public int sumNumbers(TreeNode root) {
		if (root == null) {
			return 0;
		} else {
			preOrder(root,0);
			return sum;
		} 
	}
}