LeetCode:Sum Root to Leaf Numbers
来源:互联网 发布:淘宝云建站不能用了吗 编辑:程序博客网 时间:2024/06/14 16:05
折腾了半个晚上的题目,拿到题目第一想到的是递归,就开始balabala写,主要思想是用根节点*10+左孩子的sumNumbers,怎么都不运行成功,后来想起来这是类似深度搜索,根节点*10显然是错误的。
class Solution {public: int sumNumbers(TreeNode *root) { return sumNumbers(root,0); }private: int sumNumbers(TreeNode *root, int sum){ if(!root) return 0; else{ if(!root->left&&!root->right) return sum*10+root->val; return sumNumbers(root->left,sum*10+root->val)+sumNumbers(root->right,sum*10+root->val); } }};
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
- 23种设计模式(20):责任链模式
- liunx常用命令
- 03-06-2015
- hdu2604---Queuing(AC自动机+矩阵)
- 最近总结的android疑惑(二)
- LeetCode:Sum Root to Leaf Numbers
- POJ 2965-The Pilots Brothers' refrigerator
- 安装WebLogic的详细步骤
- 手把手教你:win7下的python+django项目移植到虚拟机的Ubuntu下网页无法显示的解决方法
- android launchmode(四种启动模式)应用场景及实例
- 设计包含min或max功能的栈
- NEUQ 1256: 核电站问题
- 黑马程序员----集合类
- 黑马程序员——反射调用方法