题解 | #栈的压入、弹出序列#

用一个栈模拟一下就好了

import java.util.*;

public class Solution {
    public boolean IsPopOrder(int [] pushA,int [] popA) {
      Stack<Integer> we = new Stack<>();
        int j=0;
      for(int i =0;i<pushA.length;i++){
        
              we.push(pushA[i]);
          
          
          while(true){
              if(we.peek() == popA[j]){
                  we.pop();
                  j++;
                  if(j == popA.length || we.isEmpty()){
                      break;
                  }
              }
              else if(we.peek() != popA[j]){
                  break;
              }
          }
      }
        if(we.isEmpty()){
            return true;
         }
        else{return false;}
    }
}