|
|
function CircleQueue(size){
this.initQueue(size);
}
CircleQueue.prototype = {
//初始化隊(duì)列
initQueue : function(size){
this.size = size;
this.list = new Array();
this.capacity = size + 1;
this.head = 0;
this.tail = 0;
},
//壓入隊(duì)列
enterQueue : function(ele){
if(typeof ele == "undefined" || ele == ""){
return;
}
var pos = (this.tail + 1) % this.capacity;
if(pos == this.head){//判斷隊(duì)列是否已滿
return;
}else{
this.list[this.tail] = ele;
this.tail = pos;
}
},
//從隊(duì)列中取出頭部數(shù)據(jù)
delQueue : function(){
if(this.tail == this.head){ //判斷隊(duì)列是否為空
return;
}else{
var ele = this.list[this.head];
this.head = (this.head + 1) % this.capacity;
return ele;
}
},
//查詢隊(duì)列中是否存在此元素，存在返回下標(biāo)，不存在返回-1
find : function(ele){
var pos = this.head;
while(pos != this.tail){
if(this.list[pos] == ele){
return pos;
}else{
pos = (pos + 1) % this.capacity;
}
}
return -1;
},
//返回隊(duì)列中的元素個(gè)數(shù)
queueSize : function(){
return (this.tail - this.head + this.capacity) % this.capacity;
},
//清空隊(duì)列
clearQueue : function(){
this.head = 0;
this.tail = 0;
},
//判斷隊(duì)列是否為空
isEmpty : function(){
if(this.head == this.tail){
return true;
}else{
return false;
}
}
}
JavaScript技術(shù)：javascript中利用數(shù)組實(shí)現(xiàn)的循環(huán)隊(duì)列代碼，轉(zhuǎn)載需保留來源！
鄭重聲明：本文版權(quán)歸原作者所有，轉(zhuǎn)載文章僅為傳播更多信息之目的，如作者信息標(biāo)記有誤，請(qǐng)第一時(shí)間聯(lián)系我們修改或刪除，多謝。
