您当前位置：首页 > php开源 > php教程 > LeetCode[Tree]: Sum Root to Leaf Numbers

LeetCode[Tree]: Sum Root to Leaf Numbers

来源：程序员人生发布时间：2014-12-13 08:49:10 阅读次数：3603次

Given a binary tree containing digits from 0⑼ 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.

这个题目很简单，可用递归做：

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

生活不易，码农辛苦
如果您觉得本网站对您的学习有所帮助,可以手机扫描二维码进行捐赠
程序员人生

------分隔线----------------------------

上一篇 项目实战①―高仿知乎日报（0）-->NDK将私密数据隐藏起来

下一篇 2014年11月30日

分享到:

------分隔线----------------------------

为码而活

积分：4237

15粉丝

7关注

栏目热点