leetcode 刷题之路 9 Sum Root to Leaf Numbers

最新推荐文章于 2020-01-27 05:04:47 发布

BurningWall

最新推荐文章于 2020-01-27 05:04:47 发布

阅读量413

点赞数

分类专栏： leetcode leetcode刷题之路

本文链接：https://blog.csdn.net/u013140542/article/details/38081015

版权

leetcode刷题之路同时被 2 个专栏收录

92 篇文章 2 订阅

订阅专栏

leetcode

88 篇文章 0 订阅

订阅专栏

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.

从根节点到每个叶子节点经过的路径组成一个数字，求所有路径组成数字的和。采用递归求解，同时采用引用形参传递和，遍历路径时由节点的val字段计算出至当前节点时的数字值，在每个路径的叶子节点进行求和操作，求和操作值记录在引用形参sum中可以持久保持，或者也可以使用一个全局变量完成同样的功能。

my accepted answer:

/**
 * Definition for binary tree
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
void helper(TreeNode* root,int parentVal,int &sum)
{
	if (root == NULL)	return;
	if (root->left == NULL&&root->right == NULL)
	{
		parentVal = parentVal * 10 + root->val;
		sum += parentVal;
	} 
	if (root->left != NULL)
		helper(root->left, parentVal * 10 + root->val, sum);
	if(root->right != NULL)
		helper(root->right, parentVal * 10 + root->val, sum);
}
class Solution
{
public:
	int sumNumbers(TreeNode *root)
	{
		int sum = 0;
		helper(root, 0, sum);
		return sum;
	}
};