哪里有疑问评论问就好
#include<iostream>
#include<algorithm>
#include<vector>
#include<cstdio>
using namespace std;
struct node
{
node *left;
node *right;
int value;
node():left(NULL),right(NULL),value(-1){}
};
node* newnode()
{
return new node();
}
node* cretree(vector<int> inorder,vector<int> postorder)//左中右 左右中
{
node* head=newnode();
if(inorder.size()==1)
{
head->value=postorder.back();
return head;
}
if(inorder.size()==0)
{
return NULL;
}
head->value=postorder.back();
int i;
for(i=0;inorder[i]!=postorder.back();i++);
vector<int> zhong1(inorder.begin(),inorder.begin()+i),hou1(postorder.begin(),postorder.begin()+i);
vector<int> zhong2(inorder.begin()+i+1,inorder.end()),hou2(postorder.begin()+i,postorder.end()-1);
head->left=cretree(zhong1,hou1);
head->right=cretree(zhong2,hou2);
return head;
}
int bestsum,leaf;
void minvalue(node* head,int sum)
{
if(head->left==NULL&&head->right==NULL)
{
if(head->value+sum<bestsum)
{
bestsum=head->value+sum;
leaf=head->value;
}
return;
}
if(head->left!=NULL)minvalue(head->left,sum+head->value);
if(head->right!=NULL)minvalue(head->right,sum+head->value);
}
int read(vector<int> &inorder,vector<int> &postorder)
{
int box;
char c;
int mark=0;
inorder.clear();
postorder.clear();
int count=0;
while(cin>>box)
{
if(mark==0)mark=1;
//cin>>box;
if(mark==1)
{
inorder.push_back(box);
count++;
}
else
{
postorder.push_back(box);
count--;
if(count==0)break;
}
c=getchar();
if(c=='\n')mark=2;
}
if(mark==0)return 0;
else return 1;
}
int main()
{
//freopen("input.txt","r",stdin);
vector<int> inorder;
vector<int> postorder;
while(read(inorder,postorder))
{
/*for(int i=0;i<postorder.size();i++)
{
cout<<postorder[i]<<" ";
}*/
node* head=cretree(inorder,postorder);
bestsum=99999999;
minvalue(head,0);
cout<<leaf<<endl;
}
return 0;
}
#include<algorithm>
#include<vector>
#include<cstdio>
using namespace std;
struct node
{
node *left;
node *right;
int value;
node():left(NULL),right(NULL),value(-1){}
};
node* newnode()
{
return new node();
}
node* cretree(vector<int> inorder,vector<int> postorder)//左中右 左右中
{
node* head=newnode();
if(inorder.size()==1)
{
head->value=postorder.back();
return head;
}
if(inorder.size()==0)
{
return NULL;
}
head->value=postorder.back();
int i;
for(i=0;inorder[i]!=postorder.back();i++);
vector<int> zhong1(inorder.begin(),inorder.begin()+i),hou1(postorder.begin(),postorder.begin()+i);
vector<int> zhong2(inorder.begin()+i+1,inorder.end()),hou2(postorder.begin()+i,postorder.end()-1);
head->left=cretree(zhong1,hou1);
head->right=cretree(zhong2,hou2);
return head;
}
int bestsum,leaf;
void minvalue(node* head,int sum)
{
if(head->left==NULL&&head->right==NULL)
{
if(head->value+sum<bestsum)
{
bestsum=head->value+sum;
leaf=head->value;
}
return;
}
if(head->left!=NULL)minvalue(head->left,sum+head->value);
if(head->right!=NULL)minvalue(head->right,sum+head->value);
}
int read(vector<int> &inorder,vector<int> &postorder)
{
int box;
char c;
int mark=0;
inorder.clear();
postorder.clear();
int count=0;
while(cin>>box)
{
if(mark==0)mark=1;
//cin>>box;
if(mark==1)
{
inorder.push_back(box);
count++;
}
else
{
postorder.push_back(box);
count--;
if(count==0)break;
}
c=getchar();
if(c=='\n')mark=2;
}
if(mark==0)return 0;
else return 1;
}
int main()
{
//freopen("input.txt","r",stdin);
vector<int> inorder;
vector<int> postorder;
while(read(inorder,postorder))
{
/*for(int i=0;i<postorder.size();i++)
{
cout<<postorder[i]<<" ";
}*/
node* head=cretree(inorder,postorder);
bestsum=99999999;
minvalue(head,0);
cout<<leaf<<endl;
}
return 0;
}