forked from satojkovic/algorithms
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathstack.cpp
More file actions
91 lines (75 loc) · 1.76 KB
/
Copy pathstack.cpp
File metadata and controls
91 lines (75 loc) · 1.76 KB
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
84
85
86
87
88
89
90
91
#include <iostream>
using namespace std;
class StackElem {
public:
int data;
StackElem* next_elem;
StackElem() {
next_elem = nullptr;
}
StackElem(int value) {
data = value;
next_elem = nullptr;
}
};
class Stack
{
static const int SUCCESS = 0;
static const int ERR_EMPTY = 1;
private:
StackElem* top;
public:
Stack() {top = nullptr;}
bool isEmpty() {
return top == nullptr;
}
int pop() {
if (isEmpty()) {
return ERR_EMPTY;
}
StackElem* tmp = top;
int ret = tmp->data;
top = top->next_elem;
delete tmp;
return ret;
}
void push(int data) {
StackElem* elem = new StackElem(data);
elem->next_elem = top;
top = elem;
}
int peek() {
if (isEmpty()) {
return ERR_EMPTY;
}
return top->data;
}
void printStack() {
if (isEmpty()) {
printf("Stack is empty.\n");
return;
}
printf("Current Stack:\n");
StackElem* elem = top;
while (elem != nullptr) {
printf("%d\n", elem->data);
elem = elem->next_elem;
}
}
};
int main() {
Stack* s = new Stack();
s->printStack();
printf("push(3)\n");
s->push(3);
printf("push(1)\n");
s->push(1);
printf("push(100)\n");
s->push(100);
s->printStack();
printf("pop(): %d\n", s->pop());
printf("pop(): %d\n", s->pop());
printf("pop(): %d\n", s->pop());
s->printStack();
return 0;
}