leetcode 129. Sum Root to Leaf Numbers
来源:互联网 发布:2016淘宝小号注册方法 编辑:程序博客网 时间:2024/06/03 17:16
class Solution {public:int sumNumbers(TreeNode* root){if (root == nullptr){return sum;}process(root, 0);return sum;}private:int sum{};void process(TreeNode* root, int temp){temp = temp * 10 + root->val;if (root->left == nullptr && root->right == nullptr){sum += temp;return;}if (root->left){process(root->left, temp);}if (root->right){process(root->right, temp);}}};
0 0
- [LeetCode]129.Sum Root to Leaf Numbers
- LeetCode 129. Sum Root to Leaf Numbers
- [leetcode] 129.Sum Root to Leaf Numbers
- 【leetcode】129. Sum Root to Leaf Numbers
- [leetcode] 129. Sum Root to Leaf Numbers
- [LeetCode]129. Sum Root to Leaf Numbers
- 129. Sum Root to Leaf Numbers LeetCode
- [LeetCode]129. Sum Root to Leaf Numbers
- leetcode 129. Sum Root to Leaf Numbers
- Leetcode 129. Sum Root to Leaf Numbers
- LeetCode *** 129. Sum Root to Leaf Numbers
- LeetCode-129.Sum Root to Leaf Numbers
- LeetCode 129. sum-root-to-leaf-numbers
- LeetCode - 129. Sum Root to Leaf Numbers
- LeetCode 129. Sum Root to Leaf Numbers
- [leetcode] 129. Sum Root to Leaf Numbers
- [LeetCode] 129. Sum Root to Leaf Numbers
- Leetcode-129. Sum Root to Leaf Numbers
- 你不能不知道的 经典历史典故
- 关于mysql的安装使用以及java编程
- maven笔记5--版本管理
- 欢迎使用CSDN-markdown编辑器
- iOS 创建OpenGL 环境的思考
- leetcode 129. Sum Root to Leaf Numbers
- Java 接口编程题练习
- js返回顶部及重载
- nginx单独模块编译的makefile编写
- 如何提升自信心
- 温习static和const在C和C++的区别
- Java中BufferedReader和scanner的对比
- KMP算法
- MySQL 时间差、每15分钟统计一次数据