129. Sum Root to Leaf Numbers
来源:互联网 发布:mac系统升级安装失败 编辑:程序博客网 时间:2024/06/12 01:35
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 number123
.
Find the total sum of all root-to-leaf numbers.
For example,
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
.
解答:
/**
* Definition for a binary tree node.* struct TreeNode {
* int val;
* struct TreeNode *left;
* struct TreeNode *right;
* };
*/
int sumNumbers(struct TreeNode* root) {
int sum=0;
return num(root,sum);
}
int num(struct TreeNode* root,int sum){
int temp=0;
if(root==NULL) return 0;
sum=sum*10+root->val;
if(root->left==NULL && root->right==NULL){
return sum;
}
return num(root->left,sum)+num(root->right,sum);
}
阅读全文
0 0
- [LeetCode]129.Sum Root to Leaf Numbers
- LeetCode 129. Sum Root to Leaf Numbers
- [leetcode] 129.Sum Root to Leaf Numbers
- 129. Sum Root to Leaf Numbers
- 【leetcode】129. Sum Root to Leaf Numbers
- [leetcode] 129. Sum Root to Leaf Numbers
- [LeetCode]129. Sum Root to Leaf Numbers
- 129. Sum Root to Leaf Numbers LeetCode
- [LeetCode]129. Sum Root to Leaf Numbers
- leetcode 129. Sum Root to Leaf Numbers
- 129. Sum Root to Leaf Numbers
- Leetcode 129. Sum Root to Leaf Numbers
- 129. Sum Root to Leaf Numbers
- LeetCode *** 129. Sum Root to Leaf Numbers
- LeetCode-129.Sum Root to Leaf Numbers
- 129. Sum Root to Leaf Numbers
- 129. Sum Root to Leaf Numbers
- 129. Sum Root to Leaf Numbers
- C++中函数指针与回调函数
- ssh免密码登录配置详解
- [FAQ10400]如何在小部件列表中隐藏某个widget或者shortcut?
- 小波阀值去噪法基础
- Hadoop,Spark[一]:文件输出压缩
- 129. Sum Root to Leaf Numbers
- 二分查找法
- SQL注入思路分析(入门必看)
- 浅谈程序员该具备的自我修养
- MsgBox 常用语句
- Jenkins+Coding+Xcode+fir搭了一个持续集成环境
- 但愿人长久,千里共婵娟---众智云
- 【CodeForces】616C
- InnoDB数据库引擎