[leetcode]129. Sum Root to Leaf Numbers

你看见我的代码了么

于 2019-01-30 11:13:49 发布

阅读量202

点赞数

CC 4.0 BY-SA版权

分类专栏： LeetCode DFS Medium 文章标签： leetcode

本文链接：https://blog.csdn.net/weixin_32135877/article/details/86700532

LeetCode 同时被 3 个专栏收录

336 篇文章

订阅专栏

Medium

162 篇文章

订阅专栏

DFS

13 篇文章

订阅专栏

本文解析了LeetCode上编号为129的题目“Sum Root to Leaf Numbers”，通过递归方法遍历二叉树，计算所有从根节点到叶子节点的路径所代表的数字之和。文章提供了详细的思路分析和C++实现代码。

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

[leetcode]129. Sum Root to Leaf Numbers

Analysis

还没工作就想退休—— [每天刷题并不难0.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.
Note: A leaf is a node with no children.
在这里插入图片描述

Explanation:

看到树，递归就完事了！

Implement

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    int sumNumbers(TreeNode* root) {
        if(!root)
            return 0;
        helper(root, 0);
        return sum;
    }
    void helper(TreeNode* node, int tmp){
        if(!node->left && !node->right){
            tmp = tmp*10+node->val;
            sum += tmp;
        }
        else{
            tmp = tmp*10+node->val;
            if(node->left)
                helper(node->left, tmp);
            if(node->right)
                helper(node->right, tmp);
        }
    }
private:
    int sum = 0;
};