📄 data_struct/顺序栈.cpp
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
const int StackSize = 1024;
template <class T>
class SeqStack
{
public:
SeqStack() { top = -1; }
void Push(T x);
T Pop();
T GetTop();
bool Empty() { return top == -1 };
private:
int top;
T data[StackSize];
};
template <class T>
void SeqStack<T>::Push(T x)
{
if (top >= StackSize - 1)
throw "溢出";
data[++top] = x;
}
template <class T>
T SeqStack<T>::GetTop()
{
if (Empty())
throw "溢出";
return data[top];
}
template <class T>
T SeqStack<T>::Pop()
{
if (Empty())
throw "溢出";
return data[top--];
}