LeetCode之Sum Root to Leaf Numbers

最新推荐文章于 2023-10-10 09:42:58 发布

原创最新推荐文章于 2023-10-10 09:42:58 发布 · 1.2k 阅读

0 ·

CC 4.0 BY-SA版权

LeetCode 同时被 2 个专栏收录

55 篇文章

订阅专栏

leetcode

46 篇文章

订阅专栏

本文介绍了一种算法，用于计算二叉树中所有从根节点到叶子节点的路径所代表数字的总和。通过递归遍历的方式，将每个路径上的节点值组合成完整的数字，并最终求得所有有效路径数字的总和。

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);
	 }
};