概念： 先進(jìn)先出(FIFO)的數(shù)據(jù)接口

1. 代碼實現(xiàn)隊列Queue

function Queue() {
    var items = [];

    this.enqueue = function(element){
        items.push(element);
    };

    this.dequeue = function(){
        return items.shift();
    };

    this.front = function(){
        return items[0];
    };

    this.isEmpty = function(){
        return items.length == 0;
    };

    this.clear = function(){
        items = [];
    };

    this.size = function(){
        return items.length;
    };

    this.print = function(){
        console.log(items.toString());
    };
}

2. 優(yōu)先隊列

function PriorityQueue() {
    var items = [];

    function QueueElement (element, priority){
        this.element = element;
        this.priority = priority;
    }

    this.enqueue = function(element, priority){
        var queueElement = new QueueElement(element, priority);
        if (this.isEmpty()){
            items.push(queueElement);
        } else {
            var added = false;
            for (var i=0; i<items.length; i++){
                if (queueElement.priority < items[i].priority){
                    items.splice(i,0,queueElement);
                    added = true;
                    break;
                }
            }

            if (!added){
                items.push(queueElement);
            }
        }
    };

   //其他方法和默認(rèn)的Queue實現(xiàn)相同
}

3. 循環(huán)隊列--擊鼓傳花

function hotPotato (nameList, num){
    var queue = new Queue();
    for (var i=0; i<nameList.length; i++){
        queue.enqueue(nameList[i]);
    }

    var eliminated = '';
    while (queue.size() > 1){
        for (var i=0; i<num; i++){
            queue.enqueue(queue.dequeue());
        }
        eliminated = queue.dequeue();
        console.log(eliminated + '在擊鼓傳花游戲中被淘汰。');
    }
    return queue.dequeue();
}

摘錄自 《學(xué)習(xí)JavaScript數(shù)據(jù)結(jié)構(gòu)與算法》