-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathstack.h
71 lines (56 loc) · 1.08 KB
/
stack.h
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
#pragma once
#include <iostream>
using namespace std;
template<typename T>
class stack {
int size;
T *array;
int maxSize;
public:
stack() {
size = 0;
maxSize = 1;
array = new T[maxSize];
};
~stack() {
delete[] array;
};
void addElement(T& elem) {
if (size + 1 > maxSize) {
resize();
}
array[size] = elem;
size++;
};
T getElement() {
if (size == 0)
return 0;
return array[size - 1];
};
void deleteElement() {
if (!isEmpty()) {
size--;
}
};
void show(){
for (int i = 0; i < size; ++i) {
cout << array[i] << " ";
}
cout << endl;
};
bool isEmpty(){
return (size == 0);
};
int getSize() const{
return size;
};
void resize(){
maxSize *= 2;
T *new_array = new T[maxSize];
for (int i = 0; i < size; ++i) {
new_array[i] = array[i];
}
delete[] array;
array = new_array;
};
};