LeetCode——Sum Root to Leaf Numbers

最新推荐文章于 2025-03-25 21:56:42 发布

sanfendi

最新推荐文章于 2025-03-25 21:56:42 发布

阅读量1.5k

点赞数

分类专栏： leetcode 文章标签： leetcode

本文链接：https://blog.csdn.net/laozhaokun/article/details/34878737

版权

leetcode 专栏收录该内容

119 篇文章

订阅专栏

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.

给定一个仅包含0-9数字的二叉树，每个根到叶的路径可以代表一个数。

一个例子根到叶的路径 1->2->3 代表数123.

找出所有根到叶数的和。

想到就是深度优先遍历。

	public int sumNumbers(TreeNode root) {
		return dfs(root, 0);
	}

	public int dfs(TreeNode root, int sum) {
		if (root == null)
			return 0;
		sum = sum * 10 + root.val;
		if (root.left == null && root.right == null)
			return sum;
		return dfs(root.left, sum) + dfs(root.right, sum);
	}
	// Definition for binary tree
	public class TreeNode {
		int val;
		TreeNode left;
		TreeNode right;
		TreeNode(int x) {
			val = x;
		}
	}