class Solution {
public:
int helper(TreeNode* root, int target) {
if (root && !root->left && !root->right)
return target * 10 + root->val;
else if (!root)
return 0;
target = target * 10 + root->val;
return helper(root->left, target) + helper(root->right, target);
}
int sumNumbers(TreeNode* root) {
return helper(root, 0);
}
};
Sum Root to Leaf Numbers : 精简实现方式
最新推荐文章于 2020-06-03 23:33:59 发布