简单介绍一下栈
栈是一种先进后出的数据结构,必须要实现的接口为:Push,Pop,Top。
面向对象的栈
class Stack {
private:
int *data;
int maxSize;
int top;
public:
Stack(int maxSize): maxSize(maxSize) {
data = new int [maxSize + 1];
top = 0;
return;
}
void Clear() {
top = 0;
return;
}
int Size() {
return top;
}
int Top() {
if(top == 0)
exit(-1);
return data[top];
}
void Push(int value) {
if(top == maxSize)
exit(-1);
++top;
data[top] = value;
return;
}
void Pop() {
if(top == 0)
exit(-1);
--top;
return;
}
};