Implementing Two Stacks in a Single Array
Wed Mar 13 2024 twoStacks:
Class to efficiently manage two stacks within a single array. This implementation ensures optimal use of space by allocating opposite ends of the array to each stack and carefully managing their growth towards each other to prevent overlap and ensure maximum utilization of the allocated space.
Stack Operations:
Includes push1, push2 for adding elements to each stack, and pop1, pop2 for removing elements.
1class twoStacks {
2 constructor(size) {
3 this.size = size;
4 this.arr = new Array(size);
5 this.top1 = -1;
6 this.top2 = size;
7 }
8 push1(x) {
9 if (this.top1 < this.top2 - 1) {
10 this.arr[++this.top1] = x;
11 } else {
12 console.log("Stack Overflow");
13 }
14 }
15
16 push2(x) {
17 if (this.top1 < this.top2 - 1) {
18 this.arr[--this.top2] = x;
19 } else {
20 console.log("Stack Overflow");
21 }
22 }
23 pop1() {
24 if (this.top1 >= 0) {
25 let x = this.arr[this.top1--];
26 return x;
27 } else {
28 return -1;
29 }
30 }
31
32 pop2() {
33 if (this.top2 < this.size) {
34 let x = this.arr[this.top2++];
35 return x;
36 } else {
37 return -1;
38 }
39 }
40}
41
42let stack = new twoStacks(6);
43stack.push1(1);
44stack.push2(2);
45console.log(stack.pop1());
46stack.push1(3);
47console.log(stack.pop1());
48console.log(stack.pop1());
49