题目大意是已知二叉树的前序、中序遍历,求后序遍历。题目限制了序列长度是26,因此直接递归即可,比较容易。
我在编程时遇到的问题就是对string类的substr()方法不是很熟悉,理解错误,
basic_string substr( size_type pos = 0, size_type count = npos );
Returns a substring [pos, pos+count). If the requested substring lasts past the end of the string, or if count == npos, the returned substring is [pos, size()).
#include <stdio.h>
#include <iostream>
#include <string>
using namespace std;
char poststr[27];
int t;
void solve(string prestr,string instr)
{
if(prestr.length()==0)
return;
if(prestr.length()==1)
{
poststr[t++]=prestr[0];
return;
}
int tag=instr.find(prestr[0]);
solve(prestr.substr(1,tag),instr.substr(0,tag));
solve(prestr.substr(tag+1,prestr.length()-1-tag),instr.substr(tag+1,instr.length()-1-tag));
poststr[t++]=prestr[0];
}
int main()
{
string prestr,instr;
while(cin>>prestr>>instr)
{
t=0;
solve(prestr,instr);
poststr[prestr.length()]='\0';
cout<<poststr<<endl;
}
return 0;
}