-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathSqStack.cpp
More file actions
91 lines (88 loc) · 1.52 KB
/
Copy pathSqStack.cpp
File metadata and controls
91 lines (88 loc) · 1.52 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;
#define MaxSize 10
typedef struct Stack
{
int data[MaxSize];
int top;
} SqStack;
void Init(SqStack &S)
{
int i = 0;
for (i = 0; i < MaxSize; i++)
{
S.data[i] = 0;
}
S.top = -1;
cout << "Init……" << endl;
}
bool Destroy(SqStack &S)
{
S.top = -1;
cout << "Destroy……" << endl;
return true;
}
bool StackEmpty(SqStack S)
{
if (S.top == -1)
{
cout << "Empty" << endl;
}
return (S.top == -1);
}
bool push(SqStack &S, int e)
{
if (S.top == MaxSize - 1)
{
cout << "Stack is full" << endl;
return false;
}
// 等价
// S.top+=1;
// S.data[S.top]=e;
S.data[++S.top] = e;
cout << "push:" << e << endl;
return true;
}
bool pop(SqStack &S, int &popElem)
{
if (StackEmpty(S))
{
cout << "Stack is empty" << endl;
return false;
}
// popElem = S.data[top];
// S.top -= 1;
popElem = S.data[S.top--];
cout << "pop:" << popElem << endl;
return true;
}
bool GetTop(SqStack S, int &topElem)
{
if (StackEmpty(S))
{
cout << StackEmpty(S) << endl;
return false;
}
topElem = S.data[S.top];
cout << "top is :" << topElem << endl;
return true;
}
int main()
{
SqStack S;
Init(S);
StackEmpty(S);
int i = 0;
for (i = 0; i < MaxSize; i++)
{
push(S, i);
}
int popElem;
GetTop(S, popElem);
for (i = 0; i < MaxSize; i++)
{
pop(S, popElem);
}
Destroy(S);
}