/**
* Definition for binary tree
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
public:
void getSum(TreeNode *t, int *res, int current) {
current = current*10+t->val;
if (t->left==NULL && t->right==NULL) {
*res+=current;
return;
}
if (t->left!=NULL)
getSum(t->left, res, current);
if (t->right!=NULL)
getSum(t->right, res, current);
}
int sumNumbers(TreeNode *root) {
// Start typing your C/C++ solution below
// DO NOT write int main() function
if (root==NULL) {
return 0;
}
int res=0;
getSum(root, &res, 0);
return res;
}
};
The second time:
/**
* Definition for binary tree
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
public:
void dfs(TreeNode *root, int &res, int cur) {
if (!root) return;
int temp=cur*10+root->val;
if (root->left==NULL && root->right==NULL) {
res+=temp;
return;
}
dfs(root->left, res, temp);
dfs(root->right, res, temp);
}
int sumNumbers(TreeNode *root) {
// Note: The Solution object is instantiated only once and is reused by each test case.
int res=0, cur=0;
dfs(root, res, cur);
return res;
}
};