C++作业模板实现栈和队列

栈

#include <iostream>

using namespace std;
template <typename T>
class my_vector
{
private:
    int maxsize;
    int top;
    T data;
    T * vec;
public:
    my_vector(){maxsize=5;top=-1;vec=nullptr;}
    my_vector(int m):maxsize(m),top(-1),vec(new T[m]){}
    ~my_vector(){delete [] vec;vec=nullptr;}
    //入栈
    void puch(T e)
    {
        if(top==maxsize-1)
        {
           cout<<"栈满、插入失败\n"<<endl;
            return;
        }
        //2,入栈：先加后压
        vec[++top]=e;
        return ;
    }
    //删除
    void pop()
    {
        //1,判断栈是否为空
        if(top==-1)
        {
            cout<<"栈空，删除失败\n"<<endl;
            return;
        }
        //2,删除：先弹后减
        cout<<" "<<vec[top--]<<endl;
        return ;
    }
    //遍历：类内声名
    void output();
    //    {
    //        printf("从栈底到栈顶：\n");