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

function IsPopOrder(pushV, popV)
{
    // write code here
    let helparr = [];
    let ind = 0;
    for(let i of pushV) {
      helparr.push(i);
      while(helparr.length > 0) {
        if(helparr[helparr.length - 1] == popV[ind]){
          helparr.pop();
          ind = ind + 1;
        }else{
          break;
        }
      }
    }
    return helparr.length  == 0;
}
module.exports = {
    IsPopOrder : IsPopOrder
};