template<class T, int n> int Any Stack<T, n>: Push(T Elem) i(Tp= TopMost)、∥栈已满 return 0 Stack「Top++=Elem; return 1
template<class T, int n> int AnyStack<T, n> :: Push(T Elem) { if(Top == TopMost) // 栈已满 return 0; Stack[Top ++] = Elem; return 1; }
template<class T, int n> int AnyStack<T, n>:: Pop(T& rElem) f(Top=0)栈为空栈 return o rElem Stack[-- Top] return 1 idnet
template<class T, int n> int AnyStack<T, n> :: Pop(T& rElem) { if(Top == 0) // 栈为空栈 return 0; rElem = Stack[-- Top]; return 1; } #dneif