栈的实现

来源：互联网发布：centos 主机加固编辑：程序博客网时间：2024/04/29 10:18

```
#ifndef __STACK_H
```
```
#define __STACK_H
```
```
/*array stack*/
```
```
namespace dskit
```
```
{
```
```
    struct StackRecord;
```
```
    typedef struct StackRecord* Stack;
```
```
    
```
```
    #ifndef NULL
```
```
    #define NULL (0)
```
```
    #endif
```
```
    typedef char ElementType;
```
```
    typedef unsigned size_t; 
```
```
    
```
```
    bool IsEmpty(Stack s);
```
```
    bool IsFull(Stack s);
```

    Stack CreateStack(size_t MaxElements);

```
    void DisposeStack(Stack s);
```
```
    bool Push(ElementType x, Stack s);
```
```
    ElementType Pop(Stack s);
```
```
    ElementType Top(Stack s);
```
```
    #define EmptyTOS (-1)
```
```
    #define MinStackSize (5)
```
```
    struct StackRecord
```
```
    {
```
```
        int Capacity;
```
```
        int TopOfStack;
```
```
        ElementType* Array;
```
```
    };
```
```
}
```
```
#endif
```

.src_container{background-color:#e7e5dc; width:99%; overflow:hidden; margin:12px 0 12px 0 !important; padding:0px 3px 3px 0px}.src_container .titlebar{ background-color:#d4dfff; border:1px solid #4f81bd; border-bottom:0; padding:3px 24px; margin:0; width:auto; line-height:120%; overflow:hidden; text-align:left; font-size:12px}.src_container .toolbar{ display:inline; font-weight:normal; font-size:100%; float:right; cursor:hand; color:#00f; text-align:left; overflow:hidden}.toolbar span.button{ display:inline; font-weight:normal; font-size:100%; cursor:hand; color:#00f; text-align:left; overflow:hidden; cursor:pointer;}.src_container div.clientarea{ background-color:white; border:1px solid #4f81bd; margin:0; width:auto !important; width:100%; height:auto; overflow:auto; text-align:left; font-size:12px; font-family: "Courier New","Consolas","Fixedsys",courier,monospace,serif}.src_container ol.mainarea{ padding:0 0 0 52px; margin:0; background-color:#f7f7ff !important}.number_show{ padding-left:52px !important; list-style:decimal outside !important}.number_show li{ list-style:decimal outside !important; border-left:1px dotted #4f81bd}.number_hide{ padding-left:0px !important; list-style-type:none !important}.number_hide li{ list-style-type:none !important; border-left:0px}ol.mainarea li{ display:list-item !important; font-size:12px !important; margin:0 !important; line-height:18px !important; padding:0 0 0 0px !important; background-color:#f7f7ff !important; color:#4f81bd}ol.mainarea li pre{color:black; line-height:18px; padding:0 0 0 12px !important; margin:0em; background-color:#fff !important}.linewrap ol.mainarea li pre{white-space:pre-wrap; white-space:-moz-pre-wrapwhite-space:-pre-wrap; white-space:-o-pre-wrap; word-wrap:break-word}ol.mainarea li pre.alt{ background-color:#f7f7ff !important}

.cpp

```
#include "stack.h"
```
```
#include 
```
```
#include 
```
```
bool dskit::IsEmpty(Stack s)
```
```
{
```
```
    return s->TopOfStack == EmptyTOS;
```
```
}
```
```
bool dskit::IsFull(Stack s)
```
```
{
```

    return s->TopOfStack == s->Capacity;

```
}
```

dskit::Stack dskit::CreateStack(size_t MaxElements)

```
{
```
```
    if(MaxElements < MinStackSize)
```
```
        MaxElements = MinStackSize;
```
```
    
```
```
    Stack S;
```
```
    
```

    S = (struct StackRecord*)malloc(sizeof(struct StackRecord));

```
    if(NULL == S)
```
```
        return NULL;
```

    S->Array = (ElementType*) malloc(sizeof(ElementType) * MaxElements );

```
    if(NULL == S->Array)
```
```
    {
```
```
        free(S);
```
```
        return NULL;
```
```
    }
```
```
    S->Capacity = MaxElements;
```
```
    S->TopOfStack = EmptyTOS;
```
```
    return S;
```
```
}
```
```
void dskit::DisposeStack(Stack s)
```
```
{
```
```
    if(NULL != s)
```
```
    {
```
```
        free(s->Array);
```
```
        free(s);
```
```
    }
```
```
}
```

bool dskit::Push(ElementType x, Stack s)

```
{
```
```
    if(IsFull(s))
```
```
        return false;
```
```
    else
```
```
    {
```
```
        printf("%c was pushed./n", x);
```

        return s->Array[++s->TopOfStack] = x;

```
    }
```
```
        
```
```
}
```
```
dskit::ElementType dskit::Pop(Stack s)
```
```
{
```
```
    if(!IsEmpty(s))
```

        return s->Array[s->TopOfStack--];

```
    else
```
```
    {
```
```
        printf("Pop error/n");
```
```
        exit(-1);
```
```
    }
```
```
}
```
```
dskit::ElementType dskit::Top(Stack s)
```
```
{
```
```
    if(!IsEmpty(s))
```
```
        return s->Array[s->TopOfStack];
```
```
    else
```
```
    {
```
```
        printf("Top error/n");
```
```
        exit(-1);
```
```
    }
```
```
}
```
```
/*
```
```
int main(int argc, char* argv[])
```
```
{
```

    dskit::Stack s = dskit::CreateStack(50);

```
    dskit::Push(12, s);
```
```
    dskit::Push(13, s);
```
```
    dskit::Push(14, s);
```
```
    
```

    std::cout << dskit::Pop(s) << '/t' << std::endl;

    std::cout << dskit::Pop(s) << '/t' << std::endl;

    std::cout << dskit::Pop(s) << '/t' << std::endl;

```
    dskit::DisposeStack(s);
```
```
}
```
```
*/
```