Methods of implementing queues and stacks in JS_javascript skills

The examples in this article describe how to implement queues and stacks in JS. Share it with everyone for your reference, the details are as follows:

In object-oriented programming, methods are generally provided to implement queues and stacks. For JS, we can implement array-related operations to realize the functions of queues and stacks. See the relevant introduction below.

1. Take a look at their properties, which determine their use occasions

Queue: It is a collection that supports first-in, first-out (FIFO), that is, the data that is inserted first is taken out first!

Stack: It is a collection that supports last-in-first-out (LIFO), that is, data inserted later is taken out first!

2. Take a look at the implemented code (JS code)

var a=new Array();
a.unshift(1);
a.unshift(2);
a.unshift(3);
a.unshift(4);
console.log("先进先出")
a.pop()
var a=new Array();
a.push(1);
a.push(2);
a.push(3);
a.push(4);
console.log("后进先出")
a.pop()

Look at the running results

Readers who are interested in more JavaScript-related content can check out the special topics on this site: "Summary of JavaScript switching effects and techniques", "Summary of JavaScript search algorithm techniques", "Summary of JavaScript animation special effects and techniques", "Summary of JavaScript errors and debugging skills", "Summary of JavaScript data structures and algorithm techniques", "JavaScript traversal Summary of Algorithms and Techniques" and "Summary of JavaScript Mathematical Operation Usage"

I hope this article will be helpful to everyone in JavaScript programming.