顺序栈的c语言实现

顺序栈

一 准备工作

#include <stdio.h>
#include <stdlib.h>
#define STACK_INIT_SIZE 100
#define STACKINCREMENT 10
#define SELemTYpe int
#define Status int
#define OK 1
#define ERROR 0
typedef struct
{
    SELemTYpe * base;//the base of the stack
    SELemTYpe *top;//the head of the stack
    int stacksize;
}SqStack;

初始化栈

Status InitStack(SqStack &S)
{
    S.base = (SELemTYpe*)malloc(STACK_INIT_SIZE * sizeof(SELemTYpe));
    if(!S.base) exit(OVERFLOW);
    S.top = S.base;
    S.stacksize = STACK_INIT_SIZE;
    return OK;
    //initilize the stack
}

得到栈的栈顶元素

Status GetTop(SqStack &S,SELemTYpe &e)
{
    if(S.top == S.base) return ERROR;
    e = *(S.top-1);
    return OK;
}

元素入栈

Status push(SqStack &S,SELemTYpe e)
{
    // in the situation that the nternal storage is not enough
    if(S.top-S.base>=S.stacksize)
    {
        S.base = (SELemTYpe*)realloc(S.base, (S.stacksize+STACKINCREMENT)*sizeof(SELemTYpe));
        // realloc the space
        if(!S.base) exit(OVERFLOW);
        S.top = S.base + S.stacksize;
        // redefine the top
        S.stacksize += STACKINCREMENT;
    }
    *S.top++ = e;
    //assign the S.top first and then add the S.top
    return OK;
}

判断栈是否为空

Status StackEmpty(SqStack S)
{
    if(S.base == S.top) return OK;
    return ERROR;
}

弹出栈顶的元素

Status pop(SqStack &S,SELemTYpe &e)
{
    if(S.base == S.top) return ERROR;
    e = *--S.top;
    return OK;
}

遍历栈中的元素

Status StackTraverse(SqStack S)
{
    SELemTYpe *p;
    p = S.base;
    for (; p<S.top; p++)
    {
        printf("%d ",*p);
    }
    return OK;
}

获取栈的长度

long Stacklength(SqStack &S)
{
    return S.top - S.base;
}

清空栈

void ClearStack(SqStack &S)
{
    S.top = S.base;
}
// when we clear the stack, the storage place isn't freed.

摧毁列表

void DestoryStack(SqStack *S)
{
    free(S);
}
// free the storage place

主函数验证

int main()
{
    SqStack List;
    InitStack(List);
    for (int i=1; i<=10; i++)
    {
        push(List, i);
    }
    printf("%ld",Stacklength(List));
    StackTraverse(List);
}