https://www.cnblogs.com/grandyang/p/4273700.htmlhtml
sum表明當前節點的和。spa
這個題要從上往下的思路去作。code
class Solution { public: int sumNumbers(TreeNode* root) { return sumNumbers(root,0); } int sumNumbers(TreeNode* root,int sum){ if(!root) return 0; sum = sum*10 + root->val; if(!root->left && !root->right) return sum; return sumNumbers(root->left,sum) + sumNumbers(root->right,sum); } };