栈的封装

源代码

Stack.h

#include<iostream>
#include<cstring>
typedef   char  Stack_Data;  //栈的数据类型
const int  Stack_Size=50;   //栈的最大存储量
using namespace std;
class Stack               
{  
private:
     Stack_Data Data[Stack_Size];
     int Top;
public:
    Stack(); //初始化栈
    bool IsEmpty();//判空
    bool IsFull();//判满
    void Push(Stack_Data e);// 入栈
    bool Pop(Stack_Data *e);//出栈
    void GetTop(Stack_Data *e);//取栈顶元素
    void Display();//展示函数
    int  TopLocation();//获取Top
};
Stack::Stack()
{
    Top=0;
}
bool Stack:: IsEmpty()
{
    if(Top==0)
    {
        return true;
    }
    else 
        return false;
}
bool Stack::IsFull()
{
    if(Top==Stack_Size-1)
    {
        return true;
    }
    else 
        return false;
}
void Stack::Push(Stack_Data e)
{
    if(!IsFull())
    {
        Top++;
        Data[Top]=e;
        cout<<"Success"<<endl;
    }
    else
        cout<<"Stack OverFlow"<<endl;
}   
bool Stack::Pop(Stack_Data *e)
{
    if(!IsEmpty())
    {
        *e=Data[Top];
        Top--;
        cout<<"Success"<<endl;
        return true;
    }
    else
        cout<<"Defeat"<<endl;
        return false; 
}
void Stack::GetTop(Stack_Data *e)
{
     if(!IsEmpty())
     {
         *e=Data[Top];
         cout<<"Success"<<endl;
     }
     else 
         cout<<"Defeat"<<endl;
}
void Stack::Display()
{   
    if(!IsEmpty())
    {
        int temp=Top;
        while(temp)
        {
            cout<<"Data["<<temp<<"]   "<<Data[temp]<<endl;
            temp--;
        }
    }
    else
        cout<<"False"<<endl;
}
int  Stack::TopLocation()
{
    return Top;
}

测试代码

Main.cpp

int _tmain(int argc, _TCHAR* argv[])
{   
    Stack obj;
    bool t;
    while(true)
    {   
        cout<<"是否入栈 "<<endl;
        cout<<"是    1"<<endl;
        cout<<"否    0"<<endl;
        cin>>t;
        if(!t)
        {
            break;
        }
        Stack_Data e;
        cout<<"请输入入栈元素"<<endl;
        cin>>e;
        obj.Push(e);
    }
    obj.Display();
    while(true)
    {   
        cout<<"是否出栈 "<<endl;
        cout<<"是    1"<<endl;
        cout<<"否    0"<<endl;
        cin>>t;
        if(!t)
        {
            break;
        }
        Stack_Data e;
        if(obj.Pop(&e))
        {
            cout<<"出栈元素:  "<<e<<endl;
        }
    }
    obj.Display();
    cout<<obj.IsFull()<<endl;
    cout<<obj.IsEmpty()<<endl;
    Stack_Data e;
    obj.GetTop(&e);
    cout<<e<<endl;
    cout<<obj.TopLocation()<<endl;
    return 0;
}

   测试结果