Sum Root to Leaf Numbers

最新推荐文章于 2020-06-11 01:48:15 发布

hjhomw

最新推荐文章于 2020-06-11 01:48:15 发布

阅读量401

点赞数

分类专栏： LeetCode

本文链接：https://blog.csdn.net/hejun_haitao/article/details/52331637

版权

LeetCode 专栏收录该内容

80 篇文章 0 订阅

订阅专栏

Description:

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,

这里写图片描述

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.

代码：

#include <iostream>
#include <vector>
#include <stack>
#include <algorithm>


#define Elementype int

using namespace std;

int index = 0;


typedef struct TreeNode //树结点
{
    Elementype  val;
    TreeNode *left;
    TreeNode *right;
    TreeNode(Elementype x) : val(x), left(nullptr), right(nullptr) {}
} *Tree;


//使用先序遍历创建创建二叉树
void MakeBinaryTree(Tree &T, Elementype value[])
{
    Elementype  c = value[index++];
    if (c == '#')
        T = nullptr;
    else
    {
        T = new TreeNode(c);
        MakeBinaryTree(T->left, value);
        MakeBinaryTree(T->right, value);
    }

}


//先序遍历
void preOrderTraversal(Tree root)
{
    stack<Tree> sk;
    Tree p = root;
    if (p)
        sk.push(p);
    while (!sk.empty())
    {
        p = sk.top();
        cout << p->val<<" ";
        sk.pop();

        if (p->right)
            sk.push(p->right);

        if (p->left)
            sk.push(p->left);
    }
}

int SumRootToLeafNumbers(Tree root, int sum)
{
    if (!root)
        return 0;
    if (root->left == nullptr && root->right == nullptr)
        return 10*sum + root->val;
    return SumRootToLeafNumbers(root->left, sum * 10 + root->val) + SumRootToLeafNumbers(root->right, sum * 10 + root->val);
}

int main()
{
    Tree root = nullptr;        //根结点
    Elementype data[] = { 1, 2, '#','#', 3,'#','#' };
    MakeBinaryTree(root, data);

    cout << "先序遍历： ";
    preOrderTraversal(root);
    cout << endl;

    int sum = 0;
    cout<<SumRootToLeafNumbers(root, sum)<<endl;

    system("pause");
    return 0;
}