data-structure-and-algorithm/stack.js at main · NazifaPushon/data-structure-and-algorithm · GitHub

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
// stacks by array
// last in first out
letletter=[];// this is our stack
letword='mom'// main word
letreversedWord=""// revarsed word

// put letters into stack
for(leti=0;i<word.length;i++){
letter.push(word[i]);
}

// pop of the letters into reversed word
for(leti=0;i<word.length;i++){
reversedWord+=letter.pop();
}

// cheaking if paligdrom
if(word===reversedWord){
console.log(`${word} is palindrom number`)
}else{
console.log(`${word} is not palindrom number`)
}


// stack by class
classStack{
constructor(){
this.count=0;
this.storage={};
}
push(value){
this.storage[this.count]=value;
this.count++;
}
pop(){
if(this.count===0){
returnundefined;
}
this.count--;
letresult=this.storage[this.count];
deletethis.storage[this.count];
returnresult;
}
size(){
returnthis.count;
}
peek(){
returnthis.storage[this.count-1];
}
}

letmystack=newStack();
mystack.push(1)
mystack.push(2)
mystack.push(3)
console.log(mystack.pop());
console.log(mystack.size());
console.log(mystack.peek());