POJ 1145 （二叉树的遍历）

最新推荐文章于 2020-09-02 12:16:23 发布

兜率工

最新推荐文章于 2020-09-02 12:16:23 发布

阅读量371

点赞数

分类专栏：数据结构

本文链接：https://blog.csdn.net/qq_40679299/article/details/80329433

版权

数据结构专栏收录该内容

103 篇文章 47 订阅

订阅专栏

#include<iostream>
#include<cstdio>
#include<cstring>
#include<string>

using namespace std;

struct tree
{
    int data;
    tree *left,*right;
};

int m=0;
string trees="";

void del(tree* &go)
{
    if(go!=NULL){
        if(go->left!=NULL)
            del(go->left);
        if(go->right!=NULL)
            del(go->right);
        delete go;
    }
    go=NULL;
}

void ft(tree *go,int all,int num,int &flag)
{
    if(m+1<trees.size()&&trees[m]=='('&&trees[m+1]!=')'){
        tree *make=new tree;
        go->left=make;
        int u=m+1,sum=0,dis=0;
        if(trees[m+1]=='-'){
            dis=1;
            m++;
            u++;
        }
        while(isdigit(trees[u])){
            sum*=10;
            sum+=trees[u]-48;
            u++;
            m++;
        }
        if(dis==1)
            sum=-sum;
        make->data=sum;
        sum+=all;
        m++;
        ft(go->left,sum,num,flag);
    }else{
        go->left=NULL;
        m+=2;
    }
    if(m+1<trees.size()&&trees[m]=='('&&trees[m+1]!=')'){
        tree* make=new tree;
        go->right=make;
        int u=m+1,sum=0,dis=0;
        if(trees[m+1]=='-'){
            dis=1;
            m++;
            u++;
        }
        while(isdigit(trees[u])){
            sum*=10;
            sum+=trees[u]-48;
            u++;
            m++;
        }
        if(dis) sum=-sum;
        sum+=all;
        m++;
        ft(go->right,sum,num,flag);
    }else{
        go->right=NULL;
        m+=2;
    }
    m++;
    if(go->left==NULL&&go->right==NULL&&all==num)
        flag=1;
}

int main()
{
    int num;
    while(cin>>num){
        string mu;
        trees="";
        m=0;
        int flag=0;
        tree *go=new tree;
        go->left=go->right=NULL;
        char ch;
        int x=0;
        while(cin>>ch){
            if(ch!=' ')
                trees+=ch;
            if(ch=='(') x++;
            if(ch==')') x--;
            if(x==0) {
                break;
            }
        }
//        cout<<trees<<endl;
        ft(go,0,num,flag);
        del(go);
        if(flag)
            cout<<"yes"<<endl;
        else
            cout<<"no"<<endl;
    }
    return 0;
}