【动手敲代码】：顺序栈（C++）

#include<iostream>

template<class T>
class Stack
{
    private:
    int top;
    T* base;
    int size;
    T* elements;
    public:
    Stack<T>(int sz):size(sz),top(-1)
    {
    base = new T[sz];
    if(!base)
        std::cout << "momoryAllocationError" << std::endl;
    elements = base;
    }
    ~Stack<T>()
    {    delete[] base;    }
    bool IsEmpty() const
    { return static_cast<bool>(top == -1); }
    bool IsFull() const
    { return static_cast<bool>(top == size - 1);   }
    void Push(const T item);
    T Pop();
    void disp();
    void Destory();
};

template<class T>
void Stack<T>::Push(const T item)
{
    if(top == size - 1)
    std::cout << "Stack is full" << std::endl; 
    else
    {
    top++;
    *(elements + top) = item;
    }
}

template<class T>
T Stack<T>::Pop()
{
    if(top == -1)
    std::cout << "Stack is empty" << std::endl;
    T item = *(elements + top);
    top--;
    return item;
}

template<class T>
void Stack<T>::disp() 
{
    int p = top;
    std::cout << "*****数据输出*****" << std::endl;
    while(p + 1)
    {
    std::cout << *(elements + p) << std::endl; 
    p--;
    }
    std::cout << "*****输出结束*****" << std::endl;
}

template<class T>
void Stack<T>::Destory()
{
    ~Stack<T>();
}