求先序 Python

已知中序和后序 求先序。（蓝桥杯 算法训练）。本人参考了，我只是把语言改成了pythonhttps://blog.csdn.net/weixin_46221946/article/details/119683503?ops_request_misc=%257B%2522request%255Fid%2522%253A%2522164940700716781685314457%2522%252C%2522scm%2522%253A%252220140713.130102334.pc%255Fall.%2522%257D&request_id=164940700716781685314457&biz_id=0&utm_medium=distribute.pc_search_result.none-task-blog-2~all~first_rank_ecpm_v1~rank_v31_ecpm-6-119683503.142^v7^control,157^v4^control&utm_term=%E8%93%9D%E6%A1%A5%E6%9D%AFpython%E6%B1%82%E5%85%88%E5%BA%8F&spm=1018.2226.3001.4187https://blog.csdn.net/weixin_46221946/article/details/119683503?ops_request_misc=%257B%2522request%255Fid%2522%253A%2522164940700716781685314457%2522%252C%2522scm%2522%253A%252220140713.130102334.pc%255Fall.%2522%257D&request_id=164940700716781685314457&biz_id=0&utm_medium=distribute.pc_search_result.none-task-blog-2~all~first_rank_ecpm_v1~rank_v31_ecpm-6-119683503.142^v7^control,157^v4^control&utm_term=%E8%93%9D%E6%A1%A5%E6%9D%AFpython%E6%B1%82%E5%85%88%E5%BA%8F&spm=1018.2226.3001.4187

 总体思路就是不断地通过后序遍历将中序遍历分成左右两个子树，重点就是确定中序和后序中字母索引从哪到哪是左子树，从哪到哪是右子树。

s1=input()
s2=input()
def dfs(l1,r1,l2,r2,len):
    if len<=0:
        return
    # r2表示后序遍历的最后一个节点,也就是根节点
    print(s2[r2],end="")
    # pos是中序遍历中根所在索引，split是后序遍历中左子树最右边字母的索引
    pos=l1
    split=l2-1
    # r1中序遍历中最后一个字母的索引
    while pos<=r1:
        if s1[pos]==s2[r2]:
            break
        pos+=1
    for i in range(l1,pos):
        for j in range(l2,r2):
            if s1[i]==s2[j]:
                split=max(split,j)
    # l1是中序遍历的第一个字母索引
    # l2后序遍历中的第一个字母索引
    # 左子树
    dfs(l1,pos-1,l2,split,pos-l1)
    # 右子树
    dfs(pos+1,r1,split+1,r2-1,r1-pos)
n=len(s1)
dfs(0,n-1,0,n-1,n)