C++实现一个栈

一头进出，先进后出

定义栈的类模板

template <typename Type>
class Stack {
private:
	Type* stk; //起始地址
	int top; //指向的是栈顶元素
	int MAXN;//栈的最大存储容量
public:
	Stack(int size); //初始化一个栈时需要指定初始大小
	~Stack();//析构函数
	int push(Type x); //栈顶加入元素
	int pop(Type* px);  //栈顶删除元素
	Type getTop();  //查看栈顶元素
	int isEmpty()const;  //栈是否为空
	int isFull()const;  //栈是否为满
	int size()const;  //元素个数
};

函数实现

template <typename Type>
//构造函数初始化
Stack<Type>::Stack(int size) {
	MAXN = size;
	stk = new Type[MAXN];
	top = -1;
}

template <typename Type>
//析构函数释放掉
Stack<Type>::~Stack() {
	delete stk;
}

template <typename Type>
int Stack<Type>::push(Type x) {
	if (top >= MAXN - 1)return -1;
	stk[top] = x;
	top++；
	return 0;
}

template <typename Type>
int Stack<Type>::pop(Type* x) {
	if (top == -1)return 0;
	*x = stk[top];
	top--;
}

template <typename Type>
Type Stack<Type>::getTop() {
	if (top == -1)return NULL;//null要大写
	return stk[top];
}

template <typename Type>
int Stack<Type>::isEmpty()const {
	return top == -1;
}

template <typename Type>
int Stack<Type>::isFull()const {
	return top == MAXN - 1;
}

template <typename Type>
int Stack<Type>::size() const {
	return top;
}

测试

int main()
{
	Stack<int> s(20);
	cout << "是否为空栈" << s.isEmpty() << endl;
	s.push(1);
	cout << "1入栈" << endl;
	s.push(5);
	cout << "5入栈" << endl;
	s.push(10);
	cout << "10入栈" << endl;
	cout << "栈的大小" << s.size() << endl;
	int x = 0;
	s.pop(&x);
	cout << "删除的元素" << x << endl;
	cout << "删除一个元素后栈的大小" << s.size() << endl;
	cout << "栈顶元素" << s.getTop() << endl;
}