C++ 数据结构——两栈共享空间

/*
 两栈共享空间
 */
#include <iostream>
using namespace std;
const int maxsize=100;
template<typename T>
class BothStack
{
private:
    T data[maxsize];
    int top1,top2;
public:
    BothStack();
    ~BothStack();
    void Push(int i,T x);
    T Pop(int i);
    T GetTop(int i);
    int Empty(int i);
};
template<typename T>
BothStack<T>::BothStack()
{
    top1=-1;
    top2=maxsize;
}
template<typename T>
BothStack<T>::~BothStack()
{
    
}
template<typename T>
void BothStack<T>::Push(int i,T x)
{
    if(top1+1==top2)throw "溢出";
    if(i==1)
    {
        data[++top1]=x;
    }
    if(i==2)
    {
        data[--top2]=x;
    }
    
}
template<typename T>
T BothStack<T>::Pop(int i)
{
    if(i==1)
    {
        if(top1==-1) throw "下溢";
        else
            return data[top1--];
    }
    if(i==2)
    {
        if(top2==maxsize) throw "下溢";
        else
            return data[top2++];
    }
    return 0;
}
template<typename T>
T BothStack<T>::GetTop(int i)
{
    if(i==1)
    {
        if(top1==-1)throw "空栈";
        else
            return data[top1];
    }
    if(i==2)
    {
        if(top2==maxsize)throw "空栈";
        else
            return data[top2];
    }
    return 0;
}
template<typename T>
int BothStack<T>::Empty(int i)
{
    if(i==1)
    {
        if(top1==-1)
            return 1;
        else
            return 0;
    }
    if(i==2)
    {
        if(top2==maxsize)
            return 1;
        else
            return 0;
    }
    return 0;
}
int main()
{
    BothStack<int> L;
    L.Push(1, 23);
    L.Push(1, 33);
    L.Push(1, 43);
    L.Push(2, 11);
    L.Push(2, 19);
    //栈1
    cout<<L.Pop(1)<<endl;
    cout<<L.Pop(1)<<endl;
    cout<<L.GetTop(1)<<endl;
    if(L.Empty(1))
        cout<<"栈1为空"<<endl;
    else
        cout<<"栈1不为空"<<endl;
    cout<<L.Pop(1)<<endl;
    if(L.Empty(1))
        cout<<"栈1为空"<<endl;
    else
        cout<<"栈1不为空"<<endl;
    cout<<"---------------------"<<endl;
    //栈2
    cout<<L.Pop(2)<<endl;
    cout<<L.GetTop(2)<<endl;
    if(L.Empty(2))
        cout<<"栈2为空"<<endl;
    else
        cout<<"栈2不为空"<<endl;
    cout<<L.Pop(2)<<endl;
    if(L.Empty(2))
        cout<<"栈2为空"<<endl;
    else
        cout<<"栈2不为空"<<endl;
    return 0;
}