1、题目分析
题目链接:https://www.luogu.org/problemnew/show/P1030。其实这道题就是一道根据树的中序和后序遍历来求先序遍历。在leetcode之前做过,可以参考这里。代码稍微改改,加上输入输出即可。
2、代码
#include<iostream>
#include<string>
using namespace std;
void dfs(string &mid, string &last){
if (mid.size() == 0||last.size()==0) return;
string temp_mid_left,temp_mid_right, temp_last_left,temp_last_right;
int target = 0;
for (int i = 0; i < mid.size(); ++i){
if (mid[i] == last[last.size() - 1]){
target = i;
break;
}
}
cout << last[last.size() - 1];
for (int i = 0; i < target; ++i){
temp_mid_left.push_back(mid[i]);
temp_last_left.push_back(last[i]);
}
for (int i = target + 1; i < mid.size(); ++i){
temp_mid_right.push_back(mid[i]);
temp_last_right.push_back(last[i-1]);
}
if (temp_mid_left.size() != 0){
dfs(temp_mid_left, temp_last_left);
}
if (temp_mid_right.size() != 0){
dfs(temp_mid_right, temp_last_right);
}
}
int main(){
string a, b;
cin >> a ;
cin >> b ;
dfs(a, b);
return 0;
}