[LeetCode] Sum Root to Leaf Numbers

最新推荐文章于 2022-01-25 11:20:00 发布

seemuch

最新推荐文章于 2022-01-25 11:20:00 发布

阅读量374

点赞数

分类专栏：算法 LeetCode 文章标签：算法面试 leetcode

本文链接：https://blog.csdn.net/seemuch/article/details/17781443

版权

算法同时被 2 个专栏收录

82 篇文章 0 订阅

订阅专栏

LeetCode

77 篇文章 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.

分析：

看到binary tree，就想到用recursion。不难，只需要注意边界和特殊情况等问题即可。

代码：

class Solution {
public:
	int sumNumbers(TreeNode *root, int val) {
		int result = 0;
		int temp = val * 10 + root->val;
		if (root->left) result += sumNumbers(root->left, temp);
		if (root->right) result += sumNumbers(root->right, temp);
		if (!root->left && !root->right)
			result = temp;
		return result;
	}

	int sumNumbers(TreeNode *root) {
		if (!root)
			return 0;

		return sumNumbers(root, 0);
	}
};