129. Sum Root to Leaf Numbers

最新推荐文章于 2025-12-09 14:04:42 发布

转载最新推荐文章于 2025-12-09 14:04:42 发布 · 145 阅读

文章标签：

#algorithms #leetcode #Dynamic Programming

本文介绍了一种算法，用于解决二叉树中所有从根节点到叶子节点路径数字的总和问题。通过递归遍历的方式，计算每条路径所代表的数值，并最终返回这些数值的总和。

problem:

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:

class Solution {
public:
int i = 0;
int sumNumbers(TreeNode* root) {
if (root == NULL) return 0;
return sum(root, 0);
}
int sum(TreeNode * root, int val)
{
if (root->left == NULL && root->right == NULL) return (val * 10 + root->val);
if (root->left != NULL && root->right == NULL) return sum(root->left, val * 10 + root->val);
if (root->left == NULL && root->right != NULL) return sum(root->right, val * 10 + root->val);
if (root->left != NULL && root->right != NULL)
return sum(root->left, val * 10 + root->val) + sum(root->right, val * 10 + root->val);
}
};