Leetcode Sum Root to Leaf Numbers
来源:互联网 发布:c语言二分法求方程例题 编辑:程序博客网 时间:2024/03/29 01:11
还是dfs。跟Minimum Depth of Binary Tree以及Maximum Depth of Binary Tree很像。
/** * 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) { // IMPORTANT: Please reset any member data you declared, as // the same Solution instance will be reused for each test case. sum = 0; if(!root) return sum; dfs(root, 0); return sum; } void dfs(TreeNode *root, int n){ if(!root) return ; if(!root->left && !root->right){ sum += (n*10 + root->val); return ; } dfs(root->left, n*10+root->val); dfs(root->right, n*10+root->val); } int sum;};
- 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
- uva 11922 Permutation Transformer 排列变换 Splay 维护序列 翻转操作
- Java通过JNI调用C语言的方法
- C# 装箱和拆箱[整理]
- Uva 11019 Matrix Matcher
- CentOS/使用rsync同步
- Leetcode Sum Root to Leaf Numbers
- 最佳开源应用程序:开发工具
- 云计算(四)- Hadoop2.2.0命令大全
- Spring Security学习总结二
- trianglecocoa / InterestingTweak
- 对Java web学习的一些知识的汇集
- 库函数调用和系统调用的区别
- 设置sudo用户
- Core Animation 基础