class Solution {
public:
int res=0;
void dfs(TreeNode* root,int sum) {
sum=sum*10+root->val;
if(!root->left&&!root->right) res+=sum;
if(root->left) dfs(root->left,sum);
if(root->right) dfs(root->right,sum);
}
int sumNumbers(TreeNode* root) {
if(!root) return 0;
dfs(root,0);
return res;
}
};
Leetcode129(力扣129):求根到叶子节点数字之和
最新推荐文章于 2022-09-08 08:58:41 发布