uva536(先序 ＋ 中序输出后序)

点击题目链接

/*****************************************
Author      :Crazy_AC(JamesQi)
Time        :2015
File Name   :
*****************************************/
// #pragma comment(linker, "/STACK:1024000000,1024000000")
#include <iostream>
#include <algorithm>
#include <iomanip>
#include <sstream>
#include <string>
#include <stack>
#include <queue>
#include <deque>
#include <vector>
#include <map>
#include <set>
#include <stdio.h>
#include <string.h>
#include <math.h>
#include <stdlib.h>
#include <limits.h>
using namespace std;
#define MEM(a,b) memset(a,b,sizeof a)
typedef long long LL;
typedef unsigned long long ULL;
typedef pair<int,int> ii;
const int inf = 1 << 30;
const int INF = 0x3f3f3f3f;
const int MOD = 1e9 + 7;
inline int Readint(){
	char c = getchar();
	while(!isdigit(c)) c = getchar();
	int x = 0;
	while(isdigit(c)){
		x = x * 10 + c - '0';
		c = getchar();
	}
	return x;
}
char s1[1010],s2[1010];
int top,len;
void solve(int l,int r){
	int pre = top;
	int mid;
	// printf("[%d,%d]\n",l,r);
	for (int i = l;i <= r;i++){
		if (s2[i] == s1[top]) {
			mid = i;
			break;
		}
	}
	if (mid > l){
		top++;
		solve(l,mid - 1);
	}
	if (r > mid){
		top++;
		solve(mid + 1,r);
	}
	putchar(s2[mid]);
	if (top == len - 1) return ;
	if (l == r) return ;
}
int main()
{	
	// freopen("in.txt","r",stdin);
	// freopen("out.txt","w",stdout);
	while(~scanf("%s %s",s1,s2)){
		top = 0;
		len = strlen(s2);
		// cout << s1 << ' ' << s2 << '\n';
		solve(0,len - 1);
		cout << '\n';
	}
	return 0;
}