12-1 二叉树的凹入表示法

#include<iostream>
#include<vector>
#include<set>
#include<map>
#include<unordered_map>
using namespace std;
unordered_map<char,int>temp;
int height(string s1,string s2)
{
    //cout<<"**"<<endl;
    if(s1.size()==1&&s2.size()==1)
        return temp[s1[0]]=1;
    int j=0;
    while(s2[j]!=s1[0])
        ++j;
    return temp[s1[0]]=height(s1.substr(1,j),s2.substr(0,j))+height(s1.substr(j+1),s2.substr(j+1));
}
int main()
{
    string s1,s2;
    cin>>s1>>s2;
    height(s1,s2);
    for(int i=0;i<s1.size();++i)
    {
        for(int j=0;j!=temp[s1[i]];++j)
            cout<<s1[i];
        cout<<endl;
    }
}