c++ 用数组实现栈类

C++  /  houtizong 发布于 2年前   224

#include<iostream>#include<cassert>using namespace std;template<class T, int SIZE = 50>class Stack{private:T list[SIZE];//数组存放栈的元素int top;//栈顶位置public:Stack():top(-1){}void push(const T &item){//将元素压入栈assert(!isFull());list[++top] = item;}T pop(){//将栈顶元素弹出栈assert(!isEmpty());return list[top--];}void clear(){top = -1;}const T &peek() const{//访问栈顶元素assert(isEmpty());return list[top];}bool isEmpty()const{return top == -1;}bool isFull()const{return top == SIZE - 1;}};