classSolution{private:int ans =0;voiddfs(TreeNode* root,int cur){
cur *=10;
cur += root->val;if(!root->left and!root->right){
ans += cur;return;}if(root->left)dfs(root->left, cur);if(root->right)dfs(root->right, cur);return;}public:intsumNumbers(TreeNode* root){dfs(root,0);// root必不为空return ans;}};