LeetCode(Sum Root to Leaf Numbers)

最新推荐文章于 2022-01-25 11:20:00 发布

lqcsp

最新推荐文章于 2022-01-25 11:20:00 发布

阅读量571

点赞数

分类专栏： LeetCode 面试题 c++ 文章标签：面试 leetcode 二叉树递归

本文链接：https://blog.csdn.net/lqcsp/article/details/24350681

版权

c++ 同时被 2 个专栏收录

80 篇文章 0 订阅

订阅专栏

LeetCode 面试题

73 篇文章 1 订阅

订阅专栏

题目要求：

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.

没什么可说的就是递归

代码：

class Solution {
public:
   int sumNumbers(TreeNode *root) {
        if(root == NULL)
            return 0;
        int ret = 0;
        string tmp;
        DFS(root, ret, tmp);
        return ret;
    }
    
    void DFS(const TreeNode* root, int &sum, string &path)
    {
        if(root == NULL)
            return;
        path += root->val + '0';
        if (root->left == NULL && root->right == NULL) {
            sum += atoi(path.c_str());
            return;
        }
        if (root->left != NULL) {
            DFS(root->left, sum, path);
            path.pop_back();
        }
        
        if (root->right != NULL) {
            DFS(root->right, sum, path);
            path.pop_back();
        }
        
    }
};