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 path1->2->3
which represents the number123
.
Find the total sum of all root-to-leaf numbers.
For example,
1 / \ 2 3
The root-to-leaf path
1->2
represents the number12
.
The root-to-leaf path1->3
represents the number13
.
Return the sum = 12 + 13 =25
.
题目大意
从根结点到达叶子结点的路径代表一个数字,例如1->2->3
代表数字123
.
找到所有的路径所代表的数字,计算它们的和。
解题思路
利用DFS,终止条件为当前访问节点为空,或者没有子节点(即为叶子结点)。在当前访问节点不为空时,将当前结果向左移1个单位(十进制),即乘以10,并加上当前结点的值。
当存在子节点时,递归调用dfs,访问其子节点,并传入当前的结果。
算法复杂度
O(nlog(n))
代码实现
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
public:
int sumNumbers(TreeNode* root) {
return dfs(root, 0);
}
int dfs(TreeNode* root, int result) {
// 空节点
if (root == nullptr)
return 0;
// 子节点
if (root->left == nullptr && root->right == nullptr)
return result*10 + root->val;
return dfs(root->left, result*10 + root->val) \
+ dfs(root->right, result*10+ root->val);
}
};