Hiroshi's

function Set() { //属性 this.items = {}; //方法 //1.add方法 Set.prototype.add = function (value) { //如果当前集合已经包含了该元素 ...

function DoublyLinkedList() { this.head = null; this.tail = null; this.length = 0; function Node(data) { this.previous = null; ...

function PriorityQueue() { //基于数组的实现，数据存在数组里 this.items = []; //内部类，定义存入的每个数据的格式，包含一个元素和一个priority优先级 //priority越小优先级越高 function QueueItems(...

//Ji Gu Chuan Hua Game function function passGame(nameList, number) { // create a queue structure var q = new Queue(); //add every person on the nameList t...

//Packaging a Queue, which is based on array function Queue(){ this.items = []; } //1.Add an element to the queue. Queue.prototype.enqueue = function(ele){...