顺序栈的c语言实现,顺序栈用C语言实现(示例代码)

/*

2016年10月28日20:46:25

静态栈

*/

#include

#include

#include

#define STACK_INIT_SIZE 100 //存储空间初始分配量

#define SRAKINCRMENT 10 //存储空间分配增量

typedef struct

{

int * base; //栈底指针，在栈构造之前和摧毁之后，base的值为NULL

int * top; //栈顶指针，在非空栈始终指向栈顶元素的下一个位置

int stacksize; //当前已分配的存储空间

} SqStack;

//函数声明

void InitStack(SqStack * S);

void Push(SqStack * S, int e);

void StackTraverse(SqStack * S);

bool Pop(SqStack * S, int * e);

int main(void)

{

SqStack S;

int val;

InitStack(&S);

Push(&S,1);

Push(&S,2);

Push(&S,3);

Push(&S,4);

StackTraverse(&S);

printf("\n");

Pop(&S, &val);

Pop(&S, &val);

StackTraverse(&S);

return 0;

}

void InitStack(SqStack * S) //初始化静态栈

{

S->base = (int *)malloc(STACK_INIT_SIZE * sizeof(int));

if(NULL == S->base)

{

printf("内存分配失败，程序终止！\n");

exit(-1);

}

S->top = S->base;

S->stacksize = STACK_INIT_SIZE;

return;

}

void Push(SqStack * S, int e) //压栈

{

if( (S->top - S->base) >= S->stacksize) //如果栈满

{

S->base = (int *)realloc(S->base, (S->stacksize + SRAKINCRMENT ) * sizeof(int));

if(NULL == S->base)

{

printf("内存分配失败，程序终止！\n");

exit(-1);

}

S->top = S->base + S->stacksize;

S->stacksize += SRAKINCRMENT;

}

*(S->top) = e;

++(S->top);

return;

}

void StackTraverse(SqStack * S) //遍历输出,从栈顶开始遍历

{

int * p = S->top;

while( S->base != p)

{

printf("%d\n",*(p-1));

--p;

}

return;

}

bool Pop(SqStack * S, int * e) //出栈

{

if(S->base == S->top) //如果空

{

return false;

}

*e = *(S->top);

--(S->top);

return true;

}