int IsFull( const i return top==maxSize-l;3 private: int top; 顶数组指针 Iype* elements;数组 int max size 最大容量 template <class Type> Stack<Type>:: Stack( int s): top(1), maxSize(s)i elements=new Type[max]; assert( elements!=0);∥断言int IsFull ( ) const { return top == maxSize-1; } private: int top; //栈顶数组指针 Type *elements; //栈数组 int maxSize; //栈最大容量 } template <class Type> Stack<Type>:: Stack ( int s ) : top (-1), maxSize (s) { elements = new Type[maxSize]; assert ( elements != 0 ); //断言 }