[LeetCode] Sum root to leaf numbers
来源:互联网 发布:淘宝零食店推荐知乎 编辑:程序博客网 时间:2024/05/17 04:27
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
.
class Solution {public: int sumNumbers(TreeNode *root) { // Start typing your C/C++ solution below // DO NOT write int main() function int sum=0; sumPath(root,0,sum); return sum; } void sumPath(TreeNode* root, int prevSum, int& sum) { if(root==NULL) { return; } prevSum=prevSum*10+root->val; if(root->left==NULL && root->right==NULL) sum+=prevSum; sumPath(root->left,prevSum,sum); sumPath(root->right,prevSum,sum); }};
1. 结果在root产生,可以遵循traversal order, 一般函数递归返回结果
2. 结果在leaf节点产生,并难以遵循traversal order, 并且产生结果需要父节点的数据,可以设置全局变量或者变量引用,在递归中变量得到更新,最终返回这个变量(如这题)
- 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
- container_of
- C#防SQL注入代码实现方法
- 如何在phonegap中监听数据加载的事件
- 解决StretchBlt()压缩图片失真深入探讨
- FireFox 编译
- [LeetCode] Sum root to leaf numbers
- hashtable遍历
- Linux C编程--进程间通信(IPC)3--信号集和发送信号介绍
- 选项卡滑动显示
- C++内存管理
- java生成,读取二维码,zxing二维码
- 运维经理应具备的能力
- 消息队列
- 房地产年终奖丰厚,移动互联网功不可没