LeetCode : Sum Root to Leaf Numbers
来源:互联网 发布:新津知美术馆闭馆时间 编辑:程序博客网 时间:2024/04/28 22:38
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 sumNumbers(TreeNode *root) { // Start typing your C/C++ solution below // DO NOT write int main() function long long total = 0; long long val = 0; sum(root, val, total); return total; } void sum(TreeNode * root, long long val, long long & total){ if(!root) { return; } if(!root->left && !root->right){ total += val * 10 + root->val; return; } int curValue = val * 10 + root->val; sum(root->left, curValue, total); sum(root->right, curValue, total); }};
- leetcode 86: Sum Root to Leaf Numbers
- [LeetCode] Sum root to leaf numbers
- LeetCode : Sum Root to Leaf Numbers
- [leetcode] Sum Root to Leaf Numbers
- 【leetcode】Sum Root to Leaf Numbers
- LeetCode之sum root to leaf numbers
- leetcode:Sum Root to Leaf Numbers
- [LeetCode]Sum Root to Leaf Numbers
- [Leetcode]Sum Root to Leaf Numbers
- [leetcode]Sum Root to Leaf Numbers
- leetcode Sum Root to Leaf Numbers
- LeetCode-Sum Root to Leaf Numbers
- [leetcode] Sum Root to Leaf Numbers
- LeetCode 129: Sum Root to Leaf Numbers
- LeetCode - Sum Root to Leaf Numbers
- leetcode之Sum Root to Leaf Numbers
- LeetCode | Sum Root to Leaf Numbers
- LeetCode - Sum Root to Leaf Numbers
- 获取DDB图像的内容
- 2009西电计算机研究生复试上机题(2)
- jQuery 入门教程(10): 回调函数
- jQuery 入门教程(11): 方法链
- 链表相关操作二(两种遍历方式)
- LeetCode : Sum Root to Leaf Numbers
- 如何用花生壳搭建SVN服务器
- 机器学习中的数学(4)-线性判别分析(LDA), 主成分分析(PCA)
- “中国人口太多”是一种错觉
- HTTP请求过程
- 机器学习中的数学(3)-模型组合(Model Combining)之Boosting与Gradient Boosting
- 2013.03.11早读课——SoftReference
- [html5游戏开发]数独游戏-完整算法-开源讲座
- 2009年西电计算机研究生复试上机题(3)