class Solution {
public:
int ans;
public:
void dfs(TreeNode* root, int curNum) {
if (!root) return ;
curNum = curNum*10 + root->val;
auto left = root->left;
auto right = root->right;
if (!left && !right) ans += curNum;
dfs(left, curNum);
dfs(right, curNum);
curNum /= 10;
}
int sumNumbers(TreeNode* root){
dfs(root, 0);
return ans;
}
};
leetcode 129
最新推荐文章于 2024-08-14 15:48:50 发布
![](https://img-home.csdnimg.cn/images/20240711042549.png)