-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathstack.cpp
More file actions
244 lines (222 loc) · 4.58 KB
/
Copy pathstack.cpp
File metadata and controls
244 lines (222 loc) · 4.58 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
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
#include <iostream>
using namespace std;
const int maxsize = 5;
int stack[maxsize];
int top = -1;
//////////////////////////////////////////////////////////////////////////////////////
int numOfElement()
{
return top + 1;
}
//////////////////////////////////////////////////////////////////////////////////////
bool full()
{
if (top == maxsize - 1)
return true;
else
return false;
}
//////////////////////////////////////////////////////////////////////////////////////
bool empty()
{
if (top == -1)
return true;
else
return false;
}
//////////////////////////////////////////////////////////////////////////////////////
int pop()
{
int item;
if (empty()) {
cout << "This stack is empty" << endl;
exit(0);
}
else
{
item = stack[top];
top--;
}
return item;
}
//////////////////////////////////////////////////////////////////////////////////////
void push(int num)
{
if (full())
{
cout << "The stuck is full." << endl;
exit(0);
}
else
{
top++;
stack[top] = num;
}
}
//////////////////////////////////////////////////////////////////////////////////////
void clear()
{
top = -1;
}
//////////////////////////////////////////////////////////////////////////////////////
int stackindex(int num) {
if (empty()) {
cout << "stack is empty;";
exit(0);
}
else
for (int i = top;i >= 0;i--) {
if (stack[i] == num)
return i;
}
}
//////////////////////////////////////////////////////////////////////////////////////
int topElement()
{
return stack[top];
}
//////////////////////////////////////////////////////////////////////////////////////
int index(int num) {
if (empty()) {
cout << "stack is empty;";
exit(0);
}
else
return stack[num];
}
//////////////////////////////////////////////////////////////////////////////////////
void display() {
if (empty()) {
cout << "stack is empty;";
exit(0);
}
cout << "the element in the stack are ";
for (int i = top;i >= 0;i--) {
cout << stack[i] << " ";
}
cout << endl;
}
//////////////////////////////////////////////////////////////////////////////////////
int numElement(int item) {
int count = 0;
for (int i = top;i >= 0;i--) {
if (stack[i] == item) {
count++;
}
}
return count;
}
//////////////////////////////////////////////////////////////////////////////////////
int space() {
return maxsize - numOfElement();
}
//////////////////////////////////////////////////////////////////////////////////////
int main()
{
int idOfOpration;int numOfCases;
cout << "enter the num of case(s): ";cin >> numOfCases;
cout << "\nthe id of oporation: \n1:push \n 2:pop \n 3:empty \n 4:full \n 5:Number Of element \n 6:Clear the stack \n 7:find the number index \n 8: index of stack\n 9:display" << endl << " 10: top Element\n 11:number of repeted\n 12:space number \n 0:exit \n";
for (int i = 0;i < numOfCases;i++) {
cout << "enter the id of oporation: ";
cin >> idOfOpration;
switch (idOfOpration)
{
case 1://push
{
cout << "how many opration you want to push: ";
int pushNum;
cin >> pushNum;
int num;
for (int i = 0;i < pushNum;i++)
{
cin >> num;
push(num);
}
break;
}
case 2://pop
{
cout << "how many opration you want to pop: ";
int el;
cin >> el;
int num12;
for (int i = 0;i < el;i++)
{
cout << pop() << " ";
}
cout << "poped" << endl;
break;
}
case 3://empty
{
if (empty()) {
cout << "the stack is empty." << endl;break;
}
else {
cout << "the stack is not empty." << endl;
break;
}
}
case 4://full
{
if (full()) {
cout << "the stack is full." << endl;break;
}
else {
cout << "the stack is not full." << endl;
break;
}
}
case 5://numofelement
{
cout << "the number of element : " << numOfElement() << endl;
break;
}
case 6://clear
{
clear();
cout << "the stack is clear" << endl;
break;
}
case 7://find the index
{
int ind;
cout << "enter a number: ";
cin >> ind;
cout << endl << "the index is :" << stackindex(ind) << endl;
break;
}
case 8://find the number
{
cout << "enter stack index\n";
int inde;cin >> inde;
cout << "the number is : " << index(inde) << endl;
break;
}
case 9://display
{
display();
break;
}
case 10://top element
{
cout << "the top element :" << topElement() << endl;
break;
}
case 11://repeated element
{
int repeat;
cout << "enter the number you want : ";
cin >> repeat;
cout << numElement(repeat) << " times the number is repeted. \n";
}
case 12: {
cout << "the number of spaces : " << space()<<endl;
break;}
case 0: //exit
{
exit(0);
}
}
}
}