【数据结构】JavaScriptQueue实现

完整可运行代码classQueue{constructor(){this.count=0//队头this.head=0this.items={}}enqueue(element){this.items[this.count]=elementthis.count++;}dequeue(){if(this.isEmpty()){返回未定义；}constresult=this.items[this.head]deletethis.items[this.head]this.head++返回结果}peek(){if(this.isEmpty()){returnundefined}returnthis.items[this.head]}isEmpty(){returnthis.size()===0}clear(){this.items={}this.count=0this.head=0}size(){returnthis.count-this.head}toString(){if(this.isEmpty()){return''}letobjString=`${this.items[this.head]}`for(leti=this.head+1;ia,b,c,dqueue.dequeue()queue.dequeue()console.log(queue.toString())//-->c,dconsole.log(queue.peek())//-->cconsole.log(queue.isEmpty())//-->falseconsole.log(queue.size())//-->2