Sum Root to Leaf Numbers
来源:互联网 发布:淘宝客购物车结算 编辑:程序博客网 时间:2024/06/05 09:26
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
.
/** * Definition for binary tree * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */ class Solution {public:int get(TreeNode* root, int pre){if (0 == root) return 0;if (0 == root->left && 0 == root->right)return pre * 10 + root->val;return get(root->left, pre*10 + root->val) + get(root->right, pre*10 + root->val);} int sumNumbers(TreeNode *root){return get(root, 0); }};
0 0
- Sum Root to Leaf Numbers
- Sum Root to Leaf Numbers
- Sum Root to Leaf Numbers
- Sum Root to Leaf Numbers
- Sum Root to Leaf Numbers
- Sum Root to Leaf Numbers
- Sum Root to Leaf Numbers
- Sum Root to Leaf Numbers
- Sum Root to Leaf Numbers
- Sum Root to Leaf Numbers
- Sum Root to Leaf Numbers
- Sum Root to Leaf Numbers
- Sum Root to Leaf Numbers
- Sum Root to Leaf Numbers
- Sum Root to Leaf Numbers
- Sum Root to Leaf Numbers
- Sum Root to Leaf Numbers
- Sum Root to Leaf Numbers
- 23种经典设计模式UML类图汇总
- Rose与UML类图关系与生成代码剖析
- placement new (转)
- iOS开发之多媒体播放
- Linux利用GIMP截图
- Sum Root to Leaf Numbers
- Fedora VMware Workstation Kernel headers install
- 第一部分C语言入门 第一章 程序的基本概念
- 【讨论思考】可不可以不用pointer而实现一个linked list?
- Android AIDL proxy/stub 分析
- Balanced Binary Tree
- Android HAL 分析
- 在Java中用引号创建String对象和用构造函数的区别
- Solve Problem: “Unable to load realm info from SCDynamicStore” on Mac OS X Mavericks 10.9.1