129. 求根到叶子节点数字之和 - 力扣(LeetCode)
dfs遍历就可以了:
class Solution {
public:
int res;
void dfs(TreeNode* root, int cur){
if(!root->left && !root->right){
res += cur;
return;
}
if(root->left) dfs(root->left, 10*cur+root->left->val);
if(root->right) dfs(root->right, 10*cur+root->right->val);
}
int sumNumbers(TreeNode* root) {
if(!root) return res;
dfs(root, root->val);
return res;
}
};