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

思路：深搜，每遍历一个结点就把他的值保存起来，遍历到叶子结点就把当前的值加到sum中，回溯要去掉最后一位数。

程序：

class Solution {
public:
    int sumNumbers(TreeNode* root) {
        dfs(root);
        return sum;
    }
private:
    int sum = 0;
    int num = 0;
    void dfs(TreeNode* root) {
        if(root == NULL) return;
        else if(root->left == NULL && root->right == NULL){
            num = num * 10 + root->val;
            sum += num;
            return;
        }
        else{
            num = num * 10 + root->val;
        }
        if(root->left){
            dfs(root->left);
            num /= 10;
        }
        if(root->right){
            dfs(root->right);
            num /= 10;
        }
    }
};