1.佇列是遵循先進先出(FIFO)原則的一組有序的項,佇列在尾部添加元素,并從頂部移除元素,最新添加的元素必須排在佇列的末尾,生活中常見的例子如排隊等,
2.創建一個佇列類
class Queue{ constructor(){ this.count = 0;//記錄佇列的數量 this.lowestCount = 0;//記錄當前佇列頭部的位置 this.items = [];//用來存盤元素, } }
3.添加元素
enqueue(element){ this.items[this.count] = element; this.count++; }
4.洗掉元素(只洗掉佇列頭部)
dequeue(){ if(this.isEmpty()){ return 'queue is null'; } let resulte = this.items[this.lowestCount]; delete this.items[this.lowestCount]; this.lowestCount++; return resulte; }
5.查看佇列頭部元素
peek(){ return this.items[this.lowestCount]; }
6.判斷佇列是否為空
isEmpty(){ return this.count - this.lowestCount === 0; }
7.清除佇列的元素
clear(){ this.count = 0; this.lowestCount = 0; this.items = []; }
8.查看佇列的長度
size(){ return this.count - this.lowestCount; }
9.查看佇列的所有內容
toString(){ if(this.isEmpty())return "queue is null"; let objString = this.items[this.lowestCount]; for(let i = this.lowestCount+1; i < this.count;i++){ objString = `${objString},${this.items[i]}`; } return objString; }
10.完整代碼
class Queue{ constructor(){ this.count = 0;//記錄佇列的數量 this.lowestCount = 0;//記錄當前佇列頂部的位置 this.items = [];//用來存盤元素, } enqueue(element){ this.items[this.count] = element; this.count++; } dequeue(){ if(this.isEmpty()){ return 'queue is null'; } let resulte = this.items[this.lowestCount]; delete this.items[this.lowestCount]; this.lowestCount++; return resulte; } peek(){ return this.items[this.lowestCount]; } isEmpty(){ return this.count - this.lowestCount === 0; } size(){ return this.count - this.lowestCount; } clear(){ this.count = 0; this.lowestCount = 0; this.items = []; } toString(){ if(this.isEmpty())return "queue is null"; let objString = this.items[this.lowestCount]; for(let i = this.lowestCount+1; i < this.count;i++){ objString = `${objString},${this.items[i]}`; } return objString; } }
11.運行結果

轉載請註明出處,本文鏈接:https://www.uj5u.com/qiye/51748.html
標籤:JavaScript
