模板实现一个栈(内部使用动态申请的数组作为存储结构)

#include<iostream>
#include<vector>
#include<string>

using namespace std;

template <typename T>
class Stack
{
public:
    Stack(){}
    ~Stack(){}
    bool empty()const;
    void push(T value);
    T top()const;
    void pop();
    int size()const;
    void printStack()const;
private:
    vector<T> ve;
};

template <typename T>
bool Stack<T>::empty()const
{
    return ve.empty();
}

template <typename T>
void Stack<T>::push(T value)
{
    ve.push_back(value);
}

template <typename T>
T Stack<T>::top()const
{
    return ve.back();
}

template <typename T>
void Stack<T>::pop()
{
    ve.pop_back();
}

template <typename T>
int Stack<T>::size()const
{
    return ve.size();
}

template <typename T>
void Stack<T>::printStack()const
{
    for (auto t : ve)
        cout << t << " ";
    cout << endl;
}

int main()
{
    Stack<int> stk;
    for (int i = 0; i < 10; i++)
        stk.push(i);
    stk.pop();
    stk.printStack();

    Stack<string> stringStack;
    stringStack.push("Chicago");
    stringStack.push("Denver");
    stringStack.push("London");
    stringStack.push("California");

    cout << stringStack.top() << endl;
    cout << stringStack.size() << endl;
    stringStack.printStack();
    return 0;
}