#include<iostream.h>
#define MAX 5
//定義stack類接口
class stack{
    int num[MAX];
    int top;
public:
     stack(char *name);   //構(gòu)造函數(shù)原型
    ~stack(void);         //析構(gòu)函數(shù)原型
    void push(int n);
    int pop(void);
};
//main()函數(shù)測試stack類
main(void)
{
    int i,n;
    //聲明對(duì)象
    stack a("a"),b("b");    

    //以下利用循環(huán)和push()成員函數(shù)將2,4,6,8,10依次入a棧
    for (i=1; i<=MAX; i++)
        a.push(2*i);

    //以下利用循環(huán)和pop()成員函數(shù)依次彈出a棧中的數(shù)據(jù)，并顯示
	cout<<"a: ";
    for (i=1; i<=MAX; i++)
       cout<<a.pop()<<"  ";
    cout<<endl;

    //從鍵盤上為b棧輸入數(shù)據(jù),并顯示
    for(i=1;i<=MAX;i++) {
        cout<<i<<" b:";
        cin>>n;
        b.push(n);
    }
	cout<<"b: ";
    for(i=1;i<=MAX;i++) 
       cout<<b.pop()<<" ";
    cout<<endl;

    return 0;
}
//-------------------------
//   stack成員函數(shù)的定義
//-------------------------
//定義構(gòu)造函數(shù)
stack::stack(char *name)
{
    top=0;
    cout << "Stack "<<name<<" initialized." << endl;
}
//定義析構(gòu)函數(shù)
stack::~stack(void)
{
    cout << "stack destroyed." << endl;  //顯示信息
}
//入棧成員函數(shù)
void stack::push(int n)
{
    if (top==MAX){
        cout<<"Stack is full !"<<endl;
        return;
    };
    num[top]=n;
    top++;
}
//出棧成員函數(shù)
int stack::pop(void)
{
    top--;
    if (top<0){
        cout<<"Stack is underflow !"<<endl;
        return 0;
    };
    return num[top];
}