栈的压入、弹出序列 java

```

```import java.util.*;

public class Solution {

public boolean IsPopOrder(int [] pushA,int [] popA) {
   Stack<Integer> stack1 = new Stack<>();
   Stack<Integer> stack2 = new Stack<>();

    for(int i=popA.length-1;i>=0;i--){
        stack2.push(popA[i]);
    }
    stack1.push(pushA[0]);
    int i=1;
    while((!stack2.empty()) && i<= pushA.length){

        if( stack1.peek().equals( stack2.peek() ) ){
            stack2.pop();
            stack1.pop();
        }else{
            if(i< pushA.length){
                 stack1.push(pushA[i]);
            }
            i++;
        }
    }
    if(stack2.empty()){
        return true;
    }else{
        return false;
    }


}

}