AKOJ-1265-输出二叉树

#include <iostream>

using namespace std;

string one, two;

void Solve(int l1, int r1, int l2, int r2)
{
    if (l2 == r2)
    {
        cout << two[l2];
        return;
    }
    if (l2 > r2)
        return;
    int root = l1;
    int len = 0;//左子树的长度
    while (one[root] != two[l2 + len])
        len++;
    Solve(l1 + 1, l1 + len, l2, l2 + len - 1);
    Solve(l1 + len + 1, r1, l2 + len + 1, r2);

    cout << one[root];
}


int main()
{
    cin >> one >> two;
    Solve(0, one.size() - 1, 0, two.size() - 1);

    return 0;
}