顺序存储栈的实现

2013-08-18 15:35:11

顺序存储的栈的实现，包括初始化、销毁、push、pop、求长度、显示栈中元素、获取栈顶元素等基本操作。

注意：

1. 通过动态申请的空间一定要销毁，本实现在InitStack函数中申请空间，使用完后在函数DestoryStack中销毁；
2. 栈显示时，注意下标的更新不是在while条件判断时，应在显示元素之后，如下：

//while (base++ < top)   //下面要显示base指向的内容，因此此处不能改动
    while (base < top)
    {
        cout<<*(base)<<"	";
        base++;
    }

代码（测试暂未发现错误，欢迎交流指正！）：

#include <iostream>
#include <cassert>
using namespace std;

const size_t MAXSIZE = 100;
typedef int DataType; 

typedef struct stack
{
    size_t stackSize;
    DataType *base;
    DataType *top;
}Stack;

//初始化栈
void InitStack(Stack &s)
{
    s.base = new DataType[MAXSIZE];
    s.top = s.base;
    s.stackSize = MAXSIZE;
}

//初始化栈
void DestoryStack(Stack &s)
{
    delete [] s.base;
}

//出栈
void PushStack(Stack &s,DataType data)
{
    assert ( (s.top - s.base) < s.stackSize);  //检查是否溢出
    *s.top++ = data;
}

//入栈
DataType PopStack(Stack &s)
{
    assert ( s.top != s.base); //检查是否为空
    return *(--s.top);
}

//获取栈顶元素
DataType GetTopOfStack(Stack &s)
{
    assert ( s.top != s.base); //检查是否为空
    return *(s.top - 1);
}

//获取栈中元素个数
size_t GetLengthOfStack(Stack &s)
{
    return (s.top - s.base);
}

void DisplayStack(Stack &s)
{
    DataType *base = s.base;
    DataType *top = s.top;

    //while (base++ < top)   //下面要显示base指向的内容，因此此处不能改动
    while (base < top)
    {
        cout<<*(base)<<"	";
        base++;
    }
    cout<<endl;
}

//栈测试
void TestStack()
{
    Stack s;
    InitStack(s);
    size_t command = 0;

    const size_t PUSH = 0;
    const size_t POP = 1;
    const size_t GETLENGTH = 2;
    const size_t GETTOP = 3;

    DataType data;

    cout<<"Please enter the command ,end with ctrl+z : "<<endl;
    while (cin>>command)
    {
        switch(command)
        {
        case(PUSH):
            {
                cout<<"Please enter z data to push : "<<endl;
                cin>>data;
                cout<<"push "<<data<<endl;

                cout<<"the stack before push : "<<endl;
                DisplayStack(s);

                PushStack(s,data);    

                cout<<"the stack after push : "<<endl;
                DisplayStack(s);

                break;
            }

        case(POP):
            {
                cout<<"the stack before pop : "<<endl;
                DisplayStack(s);

                cout<<"pop "<<PopStack(s)<<endl;    

                cout<<"the stack after pop : "<<endl;
                DisplayStack(s);

                break;
            }

        case(GETLENGTH):
            {
                cout<<"the length of stack is : "<<GetLengthOfStack(s)<<endl;

                break;
            }

        case(GETTOP):
            {
                cout<<"the top element of stack is : "<<GetTopOfStack(s)<<endl;

                break;
            }
        default:
            break;
        }
        cout<<"Please enter the command ,end with ctrl+z : "<<endl;
    }

    DestoryStack(s); //销毁栈
}


int main()
{
    TestStack();
    return 0;
}

测试结果：

Please enter the command ,end with ctrl+z :
0
Please enter z data to push :
1
push 1
the stack before push :

the stack after push :
1
Please enter the command ,end with ctrl+z :
0
Please enter z data to push :
2
push 2
the stack before push :
1
the stack after push :
1       2
Please enter the command ,end with ctrl+z :
0
Please enter z data to push :
3
push 3
the stack before push :
1       2
the stack after push :
1       2       3
Please enter the command ,end with ctrl+z :
0
Please enter z data to push :
4
push 4
the stack before push :
1       2       3
the stack after push :
1       2       3       4
Please enter the command ,end with ctrl+z :
2
the length of stack is : 4
Please enter the command ,end with ctrl+z :
3
the top element of stack is : 4
Please enter the command ,end with ctrl+z :
4
Please enter the command ,end with ctrl+z :
1
the stack before pop :
1       2       3       4
pop 4
the stack after pop :
1       2       3
Please enter the command ,end with ctrl+z :
1
the stack before pop :
1       2       3
pop 3
the stack after pop :
1       2
Please enter the command ,end with ctrl+z :
1
the stack before pop :
1       2
pop 2
the stack after pop :
1
Please enter the command ,end with ctrl+z :
1
the stack before pop :
1
pop 1
the stack after pop :

Please enter the command ,end with ctrl+z :
1
the stack before pop :

Assertion failed: s.top != s.base, file e:visual studio 2010_projectssequence_
stack_2013_08_17sequence_stack_2013_08_17sequence_stack.cpp, line 39
请按任意键继续. . .