Leetcode 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.

Note: A leaf is a node with no children.

Example:
Input: [1,2,3]

Output: 25
Explanation:
The root-to-leaf path 1->2 represents the number 12.
The root-to-leaf path 1->3 represents the number 13.
Therefore, sum = 12 + 13 = 25.
Example 2:

Input: [4,9,0,5,1]

Output: 1026
Explanation:
The root-to-leaf path 4->9->5 represents the number 495.
The root-to-leaf path 4->9->1 represents the number 491.
The root-to-leaf path 4->0 represents the number 40.
Therefore, sum = 495 + 491 + 40 = 1026.

思路：
这道题让求从根节点到叶子节点所有组合数的和，想法就是在每一个叶子节点处将组合数加到最终的结果中。代码实现就是利用递归，当递归到叶子节点时，将组合数加到结果里。

C++
 int sumNumbers(TreeNode* root) {
        int sum = 0;
        getNum(root,0,sum);
        return sum;
    }
    int getNum(TreeNode* root,int num,int& sum)
    {
        if(root == nullptr)
            return 0;
        num = num*10 + root->val;
        if(root->left == nullptr&&root->right == nullptr)
        {
            sum += num;
        }
        getNum(root->left,num,sum);
        getNum(root->right,num,sum);
        return sum;
    }