题目
思路
水题
代码
#include <iostream>
#include <vector>
using namespace std;
vector<int> pre, in;
bool first = false;
bool findPost(int low, int high, int cur) {
if (low > high)
return true;
int _index = low;
while (_index <= high && pre[cur] != in[_index]) ++_index;
int bias = _index - low;
if (!findPost(low, _index - 1, cur + 1))
return false;
if (!findPost(_index + 1, high, cur + bias + 1))
return false;
cout << pre[cur];
return false;
}
int main()
{
int n;
cin >> n;
pre.resize(n);
in.resize(n);
for (int i = 0; i < n; ++i) cin >> pre[i];
for (int i = 0; i < n; ++i) cin >> in[i];
findPost(0, n - 1, 0);
return 0;
}