LeetCode Sum Root to Leaf Numbers

最新推荐文章于 2022-01-25 11:20:00 发布

kassical

最新推荐文章于 2022-01-25 11:20:00 发布

阅读量395

点赞数

分类专栏： LeetCode 文章标签： leetcode 二叉树先序遍历

本文链接：https://blog.csdn.net/kassical/article/details/38568973

版权

LeetCode 专栏收录该内容

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

/**
 * 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 allsum = 0, cursum = 0;
		if (root == NULL)
			return allsum;
		vector<TreeNode *> ivec;
		calsum(root, ivec, cursum, allsum);
		return allsum;
	}

	void calsum(TreeNode *root, vector<TreeNode *> &ivec, int &cursum, int &allsum) {
		cursum = cursum * 10 + root->val;
		ivec.push_back(root);

		if (root->left == NULL && root->right == NULL)  
			allsum += cursum;
			
		if (root->left)
			calsum(root->left, ivec, cursum, allsum);
		if (root->right)
			calsum(root->right, ivec, cursum, allsum); 
		
		ivec.pop_back();
		cursum = (cursum - root->val) / 10;
		return;
	}
};