1. 改寫(xiě)優(yōu)先隊(duì)列
   2.多一個(gè)權(quán)重變量
   我的寫(xiě)法，是創(chuàng)建一個(gè)對(duì)象，記錄元素和權(quán)重。

function PriorityQueue() {

let items = [];

this.enqueue= function (element,priority) {
    let newobj = {element,priority};
    let flag = false;
    
    for (let i = 0;i<items.length;i++){
        if(newobj[priority] > items[i][priority]){
            items.splice(i,0,newobj)
            flag = true;
            break;
        }
    }

    if(!flag){
        items.push(newobj)
    }

};
this.print = function () {
    for(let i = 0 ;i<items.length;i++){
        console.log(items[i]["element"],items[i]["priority"])
    }
}
}

let priorityQueue = new PriorityQueue();
priorityQueue.enqueue("John", 2);
priorityQueue.enqueue("Jack", 1);
priorityQueue.enqueue("Camila", 1);
priorityQueue.print();

書(shū)上寫(xiě)法，是綁定私有變量

function PriorityQueue() {

    let items = [];

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

    this.enqueue = function(element, priority){
        let queueElement = new QueueElement(element, priority);

        let added = false;
        for (let i=0; i<items.length; i++){
            if (queueElement.priority < items[i].priority){ // {2}
                items.splice(i,0,queueElement);             // {3}
                added = true;
                break; // {4}
            }
        }
        if (!added){
            items.push(queueElement); //{5}
        }
    };

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

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

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

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

    this.print = function(){
        for (let i=0; i<items.length; i++){
            console.log(`${items[i].element}  - ${items[i].priority}`);
        }
    };
}

let priorityQueue = new PriorityQueue();
priorityQueue.enqueue("John", 2);
priorityQueue.enqueue("Jack", 1);
priorityQueue.enqueue("Camila", 1);
priorityQueue.print();