LeetCode OJ 之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.

给定一个包含数字0-9的二叉树，每个从根节点到叶结点的路径代表一个数字。

一个路径的例子是1->2->3，那么代表数字123，求出所有这样的数字的和。

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.

思路：

DFS

代码：

/**
 * Definition for binary tree
 * 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;//总和
        int curNum = 0;//当前路径的和
        if(root == NULL)
            return sum;
        DFS(root , sum , curNum);
        return sum;
    }
    void DFS(TreeNode *root , int &sum , int curNum)
    {
        if(root == NULL)
            return;
        curNum = curNum * 10 + root->val;
        if(root->left == NULL && root->right == NULL)
        {
            sum += curNum;
        }
        DFS(root->left , sum , curNum);
        DFS(root->right , sum , curNum);
    }
};