ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#206059 | #883. 求先序排列 | Matthew | 100 | 0ms | 1212kb | C++ | 427b | 2024-07-20 19:17:30 | 2024-07-20 20:22:12 |
answer
#include <bits/stdc++.h>
using namespace std;
string a,b;
// BADC
// BDCA
void work(string a,string b)
{
if(a.size()<1)return;
char root = b[b.size()-1];
int p = a.find(root);
cout << root;
work(a.substr(0,p),b.substr(0,p));
work(a.substr(p+1),b.substr(p,b.length()-p-1));
}
int main()
{
cin>>a>>b;//a是中序,b是后序
work(a,b);
putchar('\n');
return 0;
}
详细
小提示:点击横条可展开更详细的信息
Test #1:
score: 20
Accepted
time: 0ms
memory: 1208kb
input:
ACEB AEBC
output:
CABE
result:
ok single line: 'CABE'
Test #2:
score: 20
Accepted
time: 0ms
memory: 1208kb
input:
BAC BCA
output:
ABC
result:
ok single line: 'ABC'
Test #3:
score: 20
Accepted
time: 0ms
memory: 1212kb
input:
DEABFCHG DEAFHGCB
output:
BAEDCFGH
result:
ok single line: 'BAEDCFGH'
Test #4:
score: 20
Accepted
time: 0ms
memory: 1212kb
input:
DCBA DCBA
output:
ABCD
result:
ok single line: 'ABCD'
Test #5:
score: 20
Accepted
time: 0ms
memory: 1208kb
input:
CBAFEGD CFGEADB
output:
BCDAEFG
result:
ok single line: 'BCDAEFG'