出栈序列是否是入栈序列

最新推荐文章于 2023-09-16 14:02:28 发布

ambition_forever

最新推荐文章于 2023-09-16 14:02:28 发布

阅读量70

点赞数

分类专栏： Algorithm 文章标签： java 算法数据结构

本文链接：https://blog.csdn.net/u014230945/article/details/119812436

版权

Algorithm 专栏收录该内容

41 篇文章 0 订阅

订阅专栏

public static boolean isPopOrder01(int[] pushA, int[] popA) {

    if (pushA.length == 0 || popA.length == 0) {
        return false;
    }

    int popIndex = 0;
    Stack<Integer> stack = new Stack<>();
    for (int num : pushA) {
        stack.push(num);
        while (!stack.isEmpty()
            && stack.peek().equals(popA[popIndex])) {
            stack.pop();
            popIndex++;
        }
    }

    System.out.println(stack);
    return stack.isEmpty();
}

public static void main(String[] args) {
    int[] pushA = {1, 2, 3, 4, 5};
    int[] popA = {5, 4, 3, 1, 2};
    System.out.println(isPopOrder01(pushA, popA));
}