#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
string s1,s2;
void calc(int l1,int r1,int l2,int r2)
{
int i,j;
int flag=0;
int ans=-1;
for(int i=l2;i<=r2;i++)
{
for(int j=l1;j<=r1;j++)
if(s2[i]==s1[j])
{
flag=1;
ans=j;
break;
}
if(flag==1)break;
}
if(ans!=-1)
cout<<s1[ans];
if(ans>l1)calc(l1,ans-1,l2+1,r2);
if(ans<r1)calc(ans+1,r1,l2+1,r2);
}
int main()
{
cin>>s1>>s2;
calc(0,s1.length()-1,0,s2.length()-1);
return 0;
}
1364:二叉树遍历(flist)
最新推荐文章于 2024-05-09 09:58:25 发布