js:資料結構筆記4--隊列

來源:互聯網
上載者:User

標籤:blog   io   os   ar   java   for   strong   sp   資料   

隊列是一種特殊的列表,資料結構為FIFO;

定義:

function Queue() {   this.dataStore = [];   this.enqueue = enqueue;   this.dequeue = dequeue;   this.front = front;   this.back = back;   this.length = length;   this.toString = toString;   this.isEmpty = isEmpty;}function enqueue(elem) {   this.dataStore.push(elem);}function dequeue() {   return this.dataStore.shift();}function front() {   return this.dataStore[0];}function back() {   return this.dataStore[this.dataStore.length - 1];}function toString() {   var retStr = "";   for(var i = 0; i < this.dataStore.length; ++i) {      retStr += this.dataStore[i] + "\n";   }   return retStr;}function length() {   return this.dataStore.length;}function isEmpty() {   if(this.dataStore.length === 0) {      return true;   } else {      return false;   }}

  

 

js:資料結構筆記4--隊列

聯繫我們

該頁面正文內容均來源於網絡整理,並不代表阿里雲官方的觀點,該頁面所提到的產品和服務也與阿里云無關,如果該頁面內容對您造成了困擾,歡迎寫郵件給我們,收到郵件我們將在5個工作日內處理。

如果您發現本社區中有涉嫌抄襲的內容,歡迎發送郵件至: info-contact@alibabacloud.com 進行舉報並提供相關證據,工作人員會在 5 個工作天內聯絡您,一經查實,本站將立刻刪除涉嫌侵權內容。

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.