LeetCode之Sum Root to Leaf Numbers

http://oj.leetcode.com/problems/sum-root-to-leaf-numbers/

计算每一条路径的数字之和，需要注意的是，对于二叉树

                    1

                 /

              2

            /

         3 

来讲，其只有一条路径，123， 而不是两条路径 [123, 12].

即：左右孩子都为NULL时才算一条路径的结束。

/**
 * 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 result = 0;
        sumSingleNumbers(root, 0, result);
        return result;
    }
    
    void sumSingleNumbers(TreeNode *root, int tmp, int &result) {
       if(root == NULL) return;
       if(root != NULL) tmp = tmp *10 + root->val;
       
       if(root->left == NULL && root->right==NULL) result += tmp;
       sumSingleNumbers(root->left, tmp, result);
       sumSingleNumbers(root->right, tmp, result);
    }
}