[Leetcode] #129 Sum Root to Leaf Numbers

Discription：

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.

Solution：

我的解法：

void sumNumbers(TreeNode* root, int num, int &result) {
	num = num * 10 + root->val;
	if (!root->left && !root->right){
		result += num;
	}
	if (root->left)
		sumNumbers(root->left, num, result);
	if (root->right)
		sumNumbers(root->right, num, result);
}

int sumNumbers(TreeNode* root) {
	if (!root) return 0;
	int num = 0;
	int result = 0;
	sumNumbers(root, num, result);
	return result;
}

Leetcode参考解法：

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

int sumNumbers(TreeNode* root) {
	return sum(root, 0);
}