22 栈的压入、弹出序列

import java.util.Random;
import java.util.Stack;
public class test22{
    private static Stack<Integer> dataStack = new Stack<Integer>();
    public static boolean check(int[] in, int[] out){
        int indexIn = 0;
        dataStack.push(in[indexIn]);
        indexIn++;
        for(int indexOut=0;indexOut<out.length;indexOut++){
            while(out[indexOut]!=dataStack.lastElement()){
                if(indexIn<in.length){
                    dataStack.push(in[indexIn]);
                    indexIn++;
                }else{
                    return false;
                }
            }
            dataStack.pop();
        }
        return true;
    }
    public static void main(String[] args){
        int in[] = {1,2,3,4,5};
        int out1[] = {4,5,3,2,1};
        int out2[] = {4,3,5,1,2};
        System.out.println(check(in,out1));
        System.out.println(check(in,out2));
        
    }
}

 

转载于:https://www.cnblogs.com/seven7seven/p/3932016.html