GeezerVisonThe World Wide Web, restored to 800 pixels of glory. |
| Home|About|Gaming cabinet|Archives|How it works|Starter sites |
GeezerVison is showing github.com — JavaScript/Data-Structures/Queue/QueueUsing2Stacks.js at master · TheAlgorithms/JavaScript Expand file tree/ Copy pathQueueUsing2Stacks.jsMore file actions 34 lines (30 loc) · 823 Bytes / Copy pathQueueUsing2Stacks.jsFile metadata and controls34 lines (30 loc) · 823 Bytes 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 // implementation of Queue using 2 stacks // contribution made by hamza chabchoub for a university project class Queue { constructor() { this.inputStack = [] this.outputStack = [] } // Push item into the inputstack enqueue(item) { this.inputStack.push(item) } dequeue() { // push all items to outputstack this.outputStack = [] while (this.inputStack.length > 0) { this.outputStack.push(this.inputStack.pop()) } // return the top element of the outputstack if any if (this.outputStack.length > 0) { const top = this.outputStack.pop() // repush all the items to the inputstack this.inputStack = [] while (this.outputStack.length > 0) { this.inputStack.push(this.outputStack.pop()) } return top } } } export { Queue } |
| You are visitor 01402503 — GeezerVison does not store the pages you look up. Best viewed with Netscape Navigator 4.7 or Internet Explorer 6 at 800×600. No cookies required. |