leetcode problem 129. Sum Root to Leaf Numbers

最新推荐文章于 2024-10-08 10:36:00 发布

Maria21

最新推荐文章于 2024-10-08 10:36:00 发布

阅读量129

点赞数

分类专栏：刷题 C/C++ 文章标签： leetcode dfs

本文链接：https://blog.csdn.net/ssjjrrrr/article/details/108074356

版权

C/C++ 同时被 2 个专栏收录

192 篇文章 1 订阅

订阅专栏

刷题

161 篇文章 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.

Example:

Input: [1,2,3]
    1
   / \
  2   3
Output: 25
Explanation:
The root-to-leaf path 1->2represents the number 12.
The root-to-leaf path 1->3represents the number 13.
Therefore, sum = 12 + 13 = 25.

Example 2:

Input: [4,9,0,5,1]
    4
   / \
  9   0
 / \
5   1
Output: 1026
Explanation:
The root-to-leaf path 4->9->5represents the number 495.
The root-to-leaf path 4->9->1represents the number 491.
The root-to-leaf path 4->0represents the number 40.
Therefore, sum = 495 + 491 + 40 = 1026.

求所有路径的和

代码如下：

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