In object-oriented programming, the implementation of queues and stacks (stack) method is generally provided, and for JS, we can implement the array of related operations, to implement the queue and stack functions, see the relevant introduction.
Take a look at their nature, and this nature determines their application.
Queue: is a set that supports FIFO (first-in-first-out), that is, the data that is inserted before it is first taken out!
Stack: A collection that supports last-in, first-out (LIFO), which is the data that is inserted after it is first taken out!
Two look at the implementation of the Code (JS code)
var a=New Array (); A.unshift (1); A.unshift (2); A.unshift (3); A.unshift (4); Console.log ("FIFO") A.pop ()var a=New Array (); A.push ( 1); A.push (2); A.push (3); A.push (4); Console.log ("LIFO") A.pop ()
Look at the results of the operation