【LectCode】129. Sum Root to Leaf Numbers

题目：

Given a binary tree containing digits from 0-9 only, each root-to-leaf path could represent a number.

An example is the root-to-leaf path 1->2->3 which represents the number 123.

Find the total sum of all root-to-leaf numbers.

For example,

    1
   / \
  2   3

The root-to-leaf path 1->2 represents the number 12.
The root-to-leaf path 1->3 represents the number 13.

Return the sum = 12 + 13 = 25.

解题思路：每扫描到一个树叶就需要把它代表的值加入和中，因此可以采取逐层递归的方法求得当前层的节点代表的值，它代表的值等于其父母节点代表的值*10 + 节点的值。

解答：

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    int sumNumbers(TreeNode* root) {
        int sum = 0;
        cal(root,0,sum);
        return sum;
        
    }
    
    void cal(TreeNode* root,int sum1, int& sum){
    if(root == NULL){
    return;
}
else if(root->left == NULL && root->right == NULL){
sum += (10 * sum1 + root->val);
}
else{
cal(root->left,10 * sum1 + root->val,sum);
cal(root->right,10 * sum1 + root->val,sum);
}

}
};