【LeetCode】sum-root-to-leaf-numbers

原创于 2018-12-27 16:29:14 发布 · 225 阅读

0 ·

CC 4.0 BY-SA版权

LeetCode 专栏收录该内容

15 篇文章

订阅专栏

本文探讨了如何在仅包含0-9数字的二叉树中寻找所有从根到叶子节点路径所代表的数字总和。通过递归算法，文章详细解析了计算过程，为读者提供了清晰的实现思路。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Given a binary tree containing digits from0-9only, each root-to-leaf path could represent a number.

An example is the root-to-leaf path1->2->3which represents the number123.

Find the total sum of all root-to-leaf numbers.

For example,

    1
   / \
  2   3

The root-to-leaf path1->2represents the number12.
The root-to-leaf path1->3represents the number13.

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 sum=0;
    int sumNumbers(TreeNode *root) {
        if(root==NULL)return 0;
         run(root,0);
        return sum;
    }
    void run(TreeNode *root,int num)
    {
       num=num*10+root->val;
      if(root->left==NULL&&root->right==NULL){
          sum+=num;
          return ;
      }
      if(root->left!=NULL)run(root->left,num);
      if(root->right!=NULL)run(root->right,num);
  }
};