/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode() : val(0), left(nullptr), right(nullptr) {}
* TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
* TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
* };
*/
class Solution {
public:
int dfs(TreeNode* root, int result) {
if(!root) return 0;
result = 10 * result + root->val;
if(!root->left && !root->right) return result;
return dfs(root->left, result) + dfs(root->right, result);
}
int sumNumbers(TreeNode* root) {
return dfs(root, 0);
}
};
【leetcode 二叉树 C++】129. Sum Root to Leaf Numbers
最新推荐文章于 2024-09-27 15:30:00 发布