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

/**
 * 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) {
		 return sumAddNumbers(root, 0);
	 }

	 int sumAddNumbers(TreeNode *root, int sum){
		 if (!root) return 0;
		 if (!root->left && !root->right)
			 return 10 * sum + root->val;
		 return sumAddNumbers(root->left, 10 * sum + root->val) + sumAddNumbers(root->right, 10 * sum + root->val);
	 }
};

LeetCode之Sum Root to Leaf Numbers,布布扣,bubuko.com

LeetCode之Sum Root to Leaf Numbers

原文：http://blog.csdn.net/smileteo/article/details/21991391