解题思路:
(1)先序遍历,回溯
class Solution {
private:
int max_sum=0;
public:
void helper(TreeNode* root,int sum) {
if(!root) return;
sum=sum*10+root->val;
if(!root->left && !root->right) max_sum+=sum;
helper(root->left,sum);
helper(root->right,sum);
return;
}
int sumNumbers(TreeNode* root) {
helper(root,0);
return max_sum;
}
};