-
Notifications
You must be signed in to change notification settings - Fork 23
/
Stack.js
83 lines (65 loc) · 1.48 KB
/
Stack.js
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
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
class Stack {
constructor() {
this.items = [];
this.count = 0;
}
// Add element to top of stack
push(element) {
this.items[this.count] = element;
console.log(`${element} added to ${this.count}`);
this.count += 1;
return this.count - 1;
}
// Return and remove top element in stack
// Return undefined if stack is empty
pop() {
if (this.count == 0) return undefined;
let deleteItem = this.items[this.count - 1];
this.count -= 1;
console.log(`${deleteItem} removed`);
return deleteItem;
}
// Check top element in stack
peek() {
console.log(`Top element is ${this.items[this.count - 1]}`);
return this.items[this.count - 1];
}
// Check if stack is empty
isEmpty() {
console.log(this.count == 0 ? "Stack is empty" : "Stack is NOT empty");
return this.count == 0;
}
// Check size of stack
size() {
console.log(`${this.count} elements in stack`);
return this.count;
}
// Print elements in stack
print() {
let str = "";
for (let i = 0; i < this.count; i++) {
str += this.items[i] + " ";
}
return str;
}
// Clear stack
clear() {
this.items = [];
this.count = 0;
console.log("Stack cleared..");
return this.items;
}
}
const stack = new Stack();
stack.isEmpty();
stack.push(100);
stack.push(200);
stack.peek();
stack.push(300);
console.log(stack.print());
stack.pop();
stack.pop();
stack.clear();
console.log(stack.print());
stack.size();
stack.isEmpty();