LeetCode[Tree]: Sum Root to Leaf Numbers
来源:互联网 发布:歌曲剪辑软件安卓版 编辑:程序博客网 时间:2024/06/16 04:17
Given a binary tree containing digits from 0-9 only, each root-to-leaf path could represent a number.
An example is the root-to-leaf path 1->2->3 which represents the number 123.
Find the total sum of all root-to-leaf numbers.
For example,
1
/ \
2 3
The root-to-leaf path 1->2 represents the number 12.
The root-to-leaf path 1->3 represents the number 13.
Return the sum = 12 + 13 = 25.
这个题目很简单,可用递归做:
class Solution {public: int sumNumbers(TreeNode *root) { sum = 0; sumNumbers(root, 0); return sum; }private: int sum; void sumNumbers(TreeNode *root, int num) { if (!root) return; num = num*10 + root->val; if (root->left == nullptr && root->right == nullptr) sum += num; if (root->left) sumNumbers(root->left, num); if (root->right) sumNumbers(root->right, num); }};
0 0
- LeetCode[Tree]: Sum Root to Leaf Numbers
- LeetCode :: Sum Root to Leaf Numbers [tree、dfs]
- [leetcode][tree][dfs] Sum Root to Leaf Numbers
- Tree-----129. 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
- 第四章 字符串 思维导图
- android自定义布局中的平滑移动
- Android使用意图传递数据之全局变量
- 实现一个简单的 eval 函数计算加减法和括号
- 【Android】状态栏通知Notification、NotificationManager详解
- LeetCode[Tree]: Sum Root to Leaf Numbers
- 由于上一篇博客没有写好JSON解析,这一篇对上一篇进行改进
- Android中px与dip,sp的转化
- Java开发中的23种设计模式详解 .
- Win7关闭休眠的方法
- android:点击popupwindow以外区域 popupwindow自动消失
- 黑马程序员——(二)数据类型
- 正则表达式 入门笔记
- hasattr函数