Sum Root to Leaf Numbers

最新推荐文章于 2020-06-11 01:48:15 发布

houshion

最新推荐文章于 2020-06-11 01:48:15 发布

阅读量203

点赞数

分类专栏： LeetCode 文章标签： LeetCode Sum Root to Leaf Num C++

本文链接：https://blog.csdn.net/lyh642784803/article/details/52077265

版权

LeetCode 专栏收录该内容

103 篇文章 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.

解题思路：

使用深度优先遍历，遍历到叶子结点就把路径上的数字代表的数值加到最终的结果上。

AC代码如下：

class Solution {
public:
	int sumNumbers(TreeNode* root) {
		if (root == NULL) return 0;
		long long int sum = 0;
		string cur = "";
		help(root, cur, sum);
		return sum;
	}

	void help(TreeNode* root, string& cur, long long int& sum)
	{
		if (root == NULL) return;
		cur.push_back('0'+root->val);
		if (root->left == NULL && root->right == NULL){
			sum += stoi(cur);
		}
		else{
			help(root->left, cur, sum);
			help(root->right, cur, sum);
		}
		cur.pop_back();
	}
};