栈的压入弹出序列

def ispoporder(ina, outa):
    if len(ina) != len(outa):
        return 1;
    
    ins = [];
    j = 0;
    i = 0;
    for i in ina:
        ins.append(i)
        while  (len(ins) > 0 and ins[len(ins)-1] == outa[j] ):
            j += 1
            ins.pop()
    if len(ins) > 0:
        print (outa,end='')
        print ("is not  a sequence of",end='')
        print (ina);
        return 1;
    else:
        print (outa,end='')
        print ("is a sequence of",end='')
        print (ina);
        return 0;
    


ina = (1,2,3,4,5,)
outa = (4,5,3,2,1)
ispoporder(ina, outa)




ina = (1,2,3,4,5,)
outa = (4,5,1,2,3)
ispoporder(ina, outa)


ina = (1,2,3,4,5,)
outa = (1,2,3,4,5)
ispoporder(ina, outa)


ina = (1,2,3,4,5,)
outa = (5,4,3,2,1)
ispoporder(ina, outa)