LeetCode: Sum Root to Leaf Numbers
来源:互联网 发布:wkwebview 的js调用oc 编辑:程序博客网 时间:2024/05/27 20:31
思路:还是深度搜索树,当前节点如果是叶子节点,则计算出从根到叶子节点表示的数(这个数在路径中一直动态存储),加到总和中。
code:
class Solution {public: void dfs(TreeNode *p,int &sum,int curNum){ if(p->left == NULL && p ->right == NULL){ curNum *= 10; curNum += p->val; sum += curNum; return; } if(p->left) dfs(p->left,sum,curNum*10+p->val); if(p->right) dfs(p->right,sum,curNum*10+p->val); } int sumNumbers(TreeNode *root) { if(root){ int ret = 0; dfs(root,ret,0); return ret; } return 0; }};
0 0
- 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
- 26古老的更好看的规划开个说得好
- iOS完整学习路线图
- LeetCode-Linked List Cycle
- 的电话电话费聚合反应简答题发个邮件看地图孤苦通过
- 7.28 网页计算器基本界面设计
- LeetCode: Sum Root to Leaf Numbers
- 搜索引擎优化算法公式
- ibatis中cachemode的配置
- LayoutParams的用法
- Nginx、LVS及HAProxy负载均衡软件的优缺点详解
- hdu 2176 取(m堆)石子游戏
- Java web server 之 Jetty
- 用递归和非递归两种方法翻转一个链表
- 《Hadoop高级编程》之为Hadoop实现构建企业级安全解决方案