JavaScript realizes the queue structure process

 function Queue(){
            
        }

function Queue(){
     this.items = [];
     //Add one (or more) new items to the end of the queue enqueue()
     Queue.prototype.enqueue = function(element){
         this.items.push(element);
     }
     //Remove the first item in the queue (i.e. the front item in the queue) dequeue()
     Queue.prototype.dequeue = function(){
          return this.items.shift();
      }
     //Return the first element in the queue front()
     Queue.prototype.front = function() {
          return this.items[0];
      }
     // Check if the stack is empty isEmpty()
     Queue.prototype.isEmpty = function(){
         return this.items.length == 0;
     }
     //Return the number of elements contained in the queue size()
     Queue.prototype.size = function(){
         return this.items.length;
     }
     //Convert the contents of the queue into a string form toString()
     Queue.prototype.toString = function(){
         var str = '';
         for(var i =0;i<this.items.length;i++){
             str += this.items[i] + ' ';
         }
         return str;
     }
 }   

 var queue = new Queue();
 queue.enqueue(10);
 queue.enqueue(20);
 queue.enqueue(30);
 queue.enqueue(40);
 queue.enqueue(50);
 console.log(queue);
 console.log('The first item removed is: ' + queue.dequeue());
 console.log('The first element in the queue is: ' + queue.front());
 console.log('Is the stack empty: '+queue.isEmpty());
 console.log('The contents of the stack structure are:');
 console.log(queue.toString());

 // Encapsulate queue function Queue(){
     this.items = [];
     //Add elements at the end Queue.prototype.enqueue = function(element){
         this.items.push(element);
     }
     //Remove the first element Queue.prototype.dequeue = function(){
         return this.items.shift();
     }
     //Return the first element Queue.prototype.front = function(){
         return this.items[0];
     }
     //Return the number of elements contained in the queue Queue.prototype.size = function(){
         return this.items.length;
     }
 }
 
 function passGame(nameList,num){
     // Create a queue var queue = new Queue();
     //Add all people to the queue for(var i = 0;i<nameList.length;i++){
         queue.enqueue(nameList[i]);
     }
     //Play the game while (queue.size() > 1) {
         //The people before num are added to the end of the queue for(var i =1;i<num;i++){
             queue.enqueue(queue.dequeue());
         }
       //People with num numbers are directly removed from queue.dequeue();
    }
    //Get the winner information var endName = queue.front();
    console.log('The remaining people are:' + endName);
    return nameList.indexOf(endName);
 }
 
 //Test var nameList = ['a','b','c','d','e'];
 var g = passGame(nameList,5);
 console.log('This person's location is: '+g);