当前位置：网站首页>JS queue

JS queue

2022-07-28 15:56:00 【PBitW】

List of articles

queue

queue

Insert picture description here

Queue structure

Insert picture description here

Queue creation – Array methods

Insert picture description here

Code implementation

<!DOCTYPE html>
<html lang="en">
<head>
  <meta charset="UTF-8">
  <meta http-equiv="X-UA-Compatible" content="IE=edge">
  <meta name="viewport" content="width=device-width, initial-scale=1.0">
  <title> Encapsulation queue </title>
</head>
<body>
  <script> function Queue(){
       //  attribute  this.items = []; //  Method  // 1. Add elements to the queue  Queue.prototype.enqueue = function(element){
       this.items.push(element); }; // 2. Remove the front-end element from the queue  Queue.prototype.delqueue = function(element){
       //  Remember that there must be a return value here, otherwise the following drum beating and flower passing is undefined, Because the default return value of the function is undefined return this.items.shift(element); }; // 3. View front-end elements  Queue.prototype.front = function(){
       return this.items[0]; } // 4. See if the queue is empty  Queue.prototype.isEmpty = function(){
       return this.items.length == 0; } // 5. View the number of elements in the queue  Queue.prototype.size = function(){
       return this.items.length; } // 6.toString Method  Queue.prototype.toString = function(){
       return this.items.join(""); } } let queue = new Queue(); console.log(queue.isEmpty()); console.log(queue.size()); queue.enqueue(1); queue.enqueue(10); queue.enqueue(8); queue.enqueue(7); console.log(queue); console.log(queue.front()); console.log(queue.isEmpty()); console.log(queue.size()); console.log(queue.toString()); queue.delqueue(); console.log(queue); console.log(queue.front()); console.log(queue.isEmpty()); console.log(queue.size()); console.log(queue.toString()); </script>
</body>
</html>

Practical application of queue – Beat the drum to spread the flowers

subject ：
Insert picture description here
It's not easy to think about joining the queue here , It is recommended to look at the code , Readers think carefully first , What will you do when you do it yourself ！

Want to join the queue , You have to think , Make a circle , Then remove each time you count to a specific , Then count ！

Code

//  Interview questions ： Beat the drum to spread the flowers 
function passGame(nameList,num){
    
  // 1  Create a queue 
  let queue1 = new Queue();
  // 2  Pass the values to the queue 
  for(i of nameList){
    
    console.log(i);
    queue1.enqueue(i);
  }
  //  You have to cycle until there is only one person left 
  while(queue1.size() > 1){
    
    //  People before the number rejoin the queue 
    // Readers with too many arrays here may be like me , At first, I felt whether it would cross the border , Actually, subscript access is not used at all , Just keep cycling , The operation was given to queue
    for(let i = 0;i<num-1;i++){
    
      queue1.enqueue(queue1.delqueue())
    }
    // num The corresponding person , Delete directly 
    queue1.delqueue();
  }
  console.log(queue1.front());
  return nameList.indexOf(queue1.front());
}
let arr = ["1","2","3","4","5"];
console.log(passGame(arr,3));