leetcode: Sum Root to Leaf Numbers 菜鸟解法
来源:互联网 发布:java 对象流 编辑:程序博客网 时间:2024/05/17 01:22
调试了很久,从最上层开始,每次增加10倍进入下一层,直到最后一层,把所有值一次加上,代码如下:
class Solution {public: int sum=0; int sumNumbers(TreeNode *root) { if(root==NULL) return 0; calSum(root,0); return sum; } void calSum(TreeNode *root,int num){ num = root->val+10*num; if(root->left==NULL&&root->right==NULL){ sum += num; return; } if(root->left!=NULL) calSum(root->left,num); if(root->right!=NULL) calSum(root->right,num); }};
0 0
- leetcode: Sum Root to Leaf Numbers 菜鸟解法
- 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
- 虚函数的作用
- Divein_day02_shell总结
- java 求标准差代码实现
- 程序员面试 基本知识
- AsyncTask和Handler的优缺点比较
- leetcode: Sum Root to Leaf Numbers 菜鸟解法
- VELT-0.1.5开发: gdb串口调试内核时信息丢失的问题
- 数据结构--尾递归
- 决策树模型
- 12种常见的并发网络服务程序设计方案
- 一个常见的js邮箱正则表达式
- UNIX环境高级编程中的11章程序11-2编译问题---undefined reference to `pthread_create'
- syswrite 函数
- 图像放缩中最近邻插值和双线性插值的基本原理