根据入栈顺序判断出栈顺序是否合理

def is_pop_order(push, pop):
    """ 根据入栈顺序判断出栈顺序是否合理 :param push: 入栈顺序 :param pop: 出栈顺序 :return: """
    if len(push) == 0:
        return False

    stack = []
    j = 0
    for i in range(len(push)):
        stack.append(push[i])
        while j < len(pop) and stack and stack[-1] == pop[j]:
            stack.pop()
            j += 1

    if len(stack) == 0:
        return True
    else:
        return False


print(is_pop_order('1234', '4321'))
print(is_pop_order('1234', '1423'))
print(is_pop_order('1234', '2134'))