function SeqStack(){this._stack = [];  //栈this._top = -1;    //栈顶指针
}
SeqStack.prototype = {_push:function(x){　　　　try{this._stack.push(x);this._top++;　　　　}catch(e){　　　　　console.log("压栈失败");　　　　}},_pop:function(){if(this._top == -1) throw Error("栈空");this._top--;return this._stack.pop();},_getTop:function(){if(this._top == -1) return "空栈";return this._stack[this._top];}
};
var s = new SeqStack();
s._push(1);
s._push(2);
s._push(3);
console.log(s._getTop());//输出3
s._pop();
console.log(s._getTop());//输出2
s._pop();
s._pop();
console.log(s._getTop());//输出空栈
s._pop();//抛出异常

function LinkStack(){this._top = null;
}
LinkStack.prototype = {_push:function(x){　　　　try{var node = {_data:x,_next:null};//至少含有此处两属性node._next = this._top;//当前和下一句不能互换，否则不能实现this._top = node;　　　　}catch(e){　　　　　console.log("压栈失败");　　　　}},_pop:function(){if(this._top == null) throw Error("栈空");var node = this._top;this._top = node._next;return node;},_getTop:function(){if(this._top == null) return "空栈";return this._top._data;}
};
var s = new LinkStack();
s._push(1);
s._push(2);
s._push(3);
console.log(s._getTop());
console.log(s._pop());
console.log(s._getTop());
console.log(s._pop());
console.log(s._pop());
console.log(s._getTop());
s._pop();

function CirQueue(){this._queue = [];this._front = this._rear = 0;//队头、队尾指针this._maxSize = 10;//队列定长为10，可以随意设置
}
CirQueue.prototype = {_enQueue:function(x){try{if(this._front == (this._rear+1)%this._maxSize) throw Error("队满");//判断是否队满this._queue.push(x);//入队this._rear = (this._rear+1)%this._maxSize;//rear指向空闲空间}catch(e){console.log("入队失败");}},_deQueue:function(){if(this._front == this._rear) throw Error("队空");//判断是否队空var q = this._queue[this._front];this._front = (this._front+1)%this._maxSize;return q;},_getQueue:function(){if(this._front == this._rear) throw Error("队空");return this._queue[this._front];}
};
var q = new CirQueue();
q._enQueue(1);
q._enQueue(2);
q._enQueue(3);
console.log(q._getQueue());//1
console.log(q._deQueue());//1
console.log(q._getQueue());//2
console.log(q._deQueue());//2
console.log(q._getQueue());//3
console.log(q._deQueue());//3
console.log(q._getQueue());//抛出异常

function LinkQueue(){this._front = this._rear = null;//队头、队尾指针
}
LinkQueue.prototype = {_enQueue:function(x){try{var node = {_data:x,_next:null};if(this._rear == null){//当队尾指针为null时，队空this._rear = this._front = node;}else{this._rear._next = node;//将当前rear的下一个元素指向nodethis._rear = node;//把rear指向当前最后的元素，即node
            }}catch(e){console.log("入队失败");}},_deQueue:function(){if(this._front == null) throw Error("队空");var q = this._front;this._front = this._front._next;//队头指针移动return q._data;},_getQueue:function(){if(this._front == null) throw Error("队空");return this._front._data;}
};
var q = new LinkQueue();
q._enQueue(1);
q._enQueue(2);
q._enQueue(3);
console.log(q._getQueue());//1
console.log(q._deQueue());//1
console.log(q._getQueue());//2
console.log(q._deQueue());//2
console.log(q._getQueue());//3
console.log(q._deQueue());//3
console.log(q._getQueue());//抛出异常

var opnd = new SeqStack();//此处的SeqStack就是之前的顺序栈
var optr = new SeqStack();var str = "3*(4+2)/2-5#";//可以换成任何你希望的算式，也可以写成函数，作为参数传入，或者由用户输入，在处理字符串前记得在最后的地方加上#结束符
for(var i=0;i<str.length;i++){if(isNaN(parseInt(str[i]))){//判断是否为数值，不为数值则进入if，为数值进入elseconsole.log("optr:"+optr._getTop());if(optr._getTop() == "空栈" || optr._getTop() == "("){optr._push(str[i]);console.log("空栈或(:"+optr._getTop());continue;}if(str[i] == ")"){while(optr._getTop() != "("){opnd._push(calculate(opnd._pop(),opnd._pop(),optr._pop()));}optr._pop();console.log("52:"+optr._getTop());continue;}var compare = priority(optr._getTop())- priority(str[i]);switch(compare>=0){case true:console.log("59:"+opnd._getTop());opnd._push(calculate(opnd._pop(),opnd._pop(),optr._pop()));console.log("61:"+opnd._getTop());i--;//保证当前元素不会因为i++被跳过break;case false:optr._push(str[i]);break;}        }else{console.log("opnd:"+opnd._getTop());opnd._push(parseInt(str[i]));//当前字符解析为数值，压入opnd栈中
    }
}
document.write(opnd._pop());
//运算符的优先级
function priority(elem){switch(elem){case "(":case ")":elem = 3;break;case "*":case "/":elem = 2;break;case "+":case "-":elem = 1;break;default:elem = 0;}return elem;
}
//计算
function calculate(num1,num2,sign){switch(sign){case "*":return num2*num1;case "/":return num2/num1;case "+":return num2+num1;case "-":return num2-num1;}
}

function carriage(k,str){var queue = [];//存储缓冲轨的数组，保存的元素是数组对象for(var j=0;j<k-1;j++){//有一条缓冲轨作为入轨到出轨的通道queue[j] = new LinkQueue();//链队列
    }var nowOut = 1;//初始化需要出列的车厢号var result = "";//最后出列的顺序for(j=0;j<str.length;j++){//遍历传入的数组if(str[j] == nowOut){//如果当前车厢号等于出列号，则直接出列，并将nowOut加一result += str[j];nowOut++;}else{var frontArr = [];//缓冲列的队头元素所在缓冲区和其车厢编号var rearArr = [];//缓冲区的队尾元素所在缓冲区和其车厢编号var emptyQu = [];//存储空的缓冲区var calc = false;//如果所以处理的方式都试过，但是并没有办法在继续，则退出算法for(var i=0;i<k-1;i++){//遍历缓冲区，获取存储的数据try{//尝试获取队头和队尾数据frontArr.push({"_index":i,"_data":queue[i]._front._data});rearArr.push({"_index":i,"_data":queue[i]._rear._data});    }catch(e){//如果缓冲区中没有数据，则把当前缓冲区的下标存储在emptyQu中
                    emptyQu.push(i);}}for(i=0;i<frontArr.length;i++){//查看队头信息，是否有队头能够出队if(frontArr[i]._data == nowOut){//当前队头正是需要出队的车厢号result += nowOut;nowOut++;queue[frontArr[i]._index]._deQueue();//出队j--;//当前的字符未用，而是在已入列的找到，故需要重新再次判断var finded = true;//已经出队，则当前一轮操作可以退出，继续下一轮calc = true;//已经进行操作break;}}if(window.finded){//退出当前一轮操作continue;}if(!!rearArr.length){//队尾数据是否存在var lowRears = [];//存储小于当前车厢号的队尾元素for(i=0;i<rearArr.length;i++){if(rearArr[i]._data < str[j]){lowRears.push(rearArr[i]._data);}}if(!!lowRears.length){//存在小于当前车厢号的队尾元素var max = Math.max.apply(Math,lowRears);//找出其中最大者rearArr.filter(function(elem){//筛选出最大者，并使其进入相应缓冲区中if(parseInt(elem["_data"]) == max){queue[parseInt(elem["_index"])]._enQueue(str[j]);}});calc = true;//已经处理了当前数据continue;}}if(!!emptyQu.length){//空缓冲区是否存在queue[emptyQu[0]]._enQueue(str[j]);//将数据入队continue;}if(!calc){//如果以上操作都没能进行，则重排失败，退出算法return "重排失败";}}}while(nowOut <= str.length){//将还在缓冲区中的数据依次遍历，尝试出列for(var m=0;m<queue.length;m++){try{if(queue[m]._getQueue() == nowOut){result += nowOut;queue[m]._deQueue();nowOut++;}    }catch(e){};}}return result;//将最后的结果返回
}
document.write(carriage(3,[3,6,9,2,4,7,1,8,5]));//123456789
document.write(carriage(3,[3,10,6,9,2,4,7,1,8,5]));//重排失败