- LeetCode 129. Sum Root to Leaf N
- 129. Sum Root to Leaf Numbers
- 算法练习--LeetCode--129. Sum Root to
- Leetcode 129. Sum Root to Leaf N
- Leetcode 129. Sum Root to Leaf N
- Leetcode 129. Sum Root to Leaf N
- 【LeetCode】129. Sum Root to Leaf
- LeetCode - Sum of Root To Leaf B
- Sum Root to Leaf Numbers
- 129. Sum Root to Leaf Numbers
文章作者:Tyan
博客:noahsnail.com | CSDN | 简书
1. Description
![](https://img.haomeiwen.com/i3232548/9ae1852eefe78670.png)
2. Solution
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
public:
int sumNumbers(TreeNode* root) {
if(!root) {
return 0;
}
int sum = 0;
traverseSum(root, sum, 0);
return sum;
}
private:
void traverseSum(TreeNode* root, int& sum, int current) {
current = current * 10 + root->val;
if(!root->left && !root->right) {
sum += current;
return;
}
if(root->left) {
traverseSum(root->left, sum, current);
}
if(root->right) {
traverseSum(root->right, sum, current);
}
}
};
网友评论