LeetCode 129. Sum Root to Leaf Numbers（二叉树）

最新推荐文章于 2023-07-01 12:29:35 发布

da_kao_la

最新推荐文章于 2023-07-01 12:29:35 发布

阅读量176

点赞数

分类专栏： LeetCode 文章标签： LeetCode Medium Cpp 二叉树

本文链接：https://blog.csdn.net/da_kao_la/article/details/93322204

版权

LeetCode 专栏收录该内容

371 篇文章 0 订阅

订阅专栏

题目来源：https://leetcode.com/problems/sum-root-to-leaf-numbers/

问题描述

129. Sum Root to Leaf Numbers

Medium

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.

Example:

Input: [1,2,3]

/ \

2 3

Output: 25

Explanation:

The root-to-leaf path 1->2 represents the number 12.

The root-to-leaf path 1->3 represents the number 13.

Therefore, sum = 12 + 13 = 25.

Example 2:

Input: [4,9,0,5,1]

/ \

9 0

/ \

5 1

Output: 1026

Explanation:

The root-to-leaf path 4->9->5 represents the number 495.

The root-to-leaf path 4->9->1 represents the number 491.

The root-to-leaf path 4->0 represents the number 40.

Therefore, sum = 495 + 491 + 40 = 1026.

------------------------------------------------------------

题意

二叉树每一条从根节点到叶节点的路径构成一个十进制整数，求这些十进制整数的和。

------------------------------------------------------------

思路

递归

------------------------------------------------------------

代码

/**
 * 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 {
private:
    /**
    * Paramters:
    *   root: current node on path
    *   num: current number on path from root to left
    *   ans: sum of numbers
    */
    void dfs(TreeNode* root, int num, int& ans) {
        if (!root) {
            return;
        }
        num  = num * 10 + root->val;
        if (!root->left && !root->right) {
            ans += num;
        }
        dfs(root->left, num, ans);
        dfs(root->right, num, ans);
        num /= 10;
    }

public:
    int sumNumbers(TreeNode* root) {
        int ans = 0;
        dfs(root, 0, ans);
        return ans;
    }
};