剑指offer-问题22

package offer;

import java.util.Stack;

/**
 * offer interview 22
 */
public class Test22 {

    //method 1
    public static boolean isPopOrder(int[] push ,int[] pop){
        if (push == null
                || pop == null
                || pop.length == 0
                || push.length == 0
                || push.length != pop.length){
            return false;
        }

        Stack<Integer> stack = new Stack<>();
        int pushIndex = 0;
        int popIndex = 0;

        while (popIndex < pop.length){
            while (pushIndex < push.length
                    && (stack.isEmpty()
                        || stack.peek() != pop[popIndex])){
                stack.push(push[pushIndex]);
                pushIndex++;
            }

            if (stack.peek() == pop[popIndex]){
                stack.pop();
                popIndex++;
            }else{
                return false;
            }

        }
        //return stack.isEmpty();
        return true;
    }

    public static void main(String[] args){
        int[] push = {1,2,3,4,5};
        int[] pop1 = {4,5,3,2,1};
        int[] pop2 = {3,5,4,2,1};
        int[] pop3 = {4,3,5,1,2};
        int[] pop4 = {3,5,4,1,2};


        System.out.println(isPopOrder(push,pop1));
        System.out.println(isPopOrder(push,pop2));
        System.out.println(isPopOrder(push,pop3));
        System.out.println(isPopOrder(push,pop4));

        int[] push5 = {1};
        int[] pop5 = {2};
        System.out.println(isPopOrder(push5,pop5));

        int[] push6 = {1};
        int[] pop6 = {1};
        System.out.println(isPopOrder(push6,pop6));

        int[] push7 = {1};
        int[] pop7 = {};
        System.out.println(isPopOrder(push7,pop7));

        int[] push8 = {};
        int[] pop8 = {1};
        System.out.println(isPopOrder(push8,pop8));

        int[] push9 = {};
        int[] pop9 = {};
        System.out.println(isPopOrder(push9,pop9));


    }

}

 

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值