当前位置: 首页 > Web前端 > JavaScript

数据结构-js实现-队列

时间:2023-03-27 00:04:20 JavaScript

classQueue{constructor(){this.count=0;this.lowestCount=0;this.items={};}isEmpty(){返回this.count===this.lowestCount;}enqueue(element){this.items[this.count]=element;这个。计数++;}dequeue(){if(this.isEmpty()){returnvoid0;}constresult=this.items[this.lowestCount];删除this.items[this.lowestCount];this.lowestCount++;返回结果;}//查看第一个元素peek(){if(this.isEmpty()){returnvoid0;}返回this.items[this.lowestCount];}size(){returnthis.count-this.lowestCount;}clear(){this.count=0;this.items={};this.lowestCount=0;}toString(){如果(this.isEmpty()){返回“”;}让结果=this.peek();for(leti=this.lowestCount+1;i