C语言实现栈的基本操作

直接上代码：

#ifndef _SEQSTACK_H_
#define _SEQSTACK_H_


//顺序栈
#include <stdio.h>
#include <stdlib.h>
#include <stdbool.h>


#define STACK_INIT_SIZE 100
#define STACKINCREMENT 10


typedef int ElemType;
typedef struct{
ElemType *base;//栈底指针
ElemType *top;//栈顶指针
int size;//可用栈的最大容量
}SeqStack;


//构建一个空栈
bool initStack(SeqStack *s);
//销毁栈
bool destroyStack(SeqStack *s);
//把栈置为空
bool clearStack(SeqStack *s);
//判断栈是否为空
bool stackIsEmpty(SeqStack *s);
//获取栈的长度
int getStackLength(SeqStack *s);
//获取栈顶元素
bool getTop(SeqStack *s,ElemType *elem);
//入栈
bool push(SeqStack *s,ElemType elem);
//出栈
bool pop(SeqStack *s,ElemType *elem);
//从栈底到栈顶依次对栈中每个元素调用pfun(),一旦调用失败就返回失败
bool stackTraverse(SeqStack *s,void (*pfun)(ElemType elem));
//打印一个元素
void printStack(ElemType elem);
#endif

实现：seqStack.c

#include <stdio.h>
#include "seqStack.h"


/*********************************************************
typedef int ElemType;
typedef struct{
ElemType *base;//栈底指针
ElemType *top;//栈顶指针
int size;//栈大小
}SeqStack;


//构建一个空栈
bool initStack(SeqStack *s);
//销毁栈
bool destroyStack(SeqStack *s);
//把栈置为空
bool clearStack(SeqStack *s);
//判断栈是否为空
bool stackIsEmpty(SeqStack *s);
//获取栈的长度
int getStackLength(SeqStack *s);
//获取栈顶元素
bool getTop(SeqStack *s,ElemType *elem);
//入栈
bool push(seqStack *s,ElemType elem);
//出栈
bool pop(seqStack *s,ElemType *elem);
//从栈底到栈顶依次对栈中每个元素调用pfun(),一旦调用失败就返回失败
bool stackTraverse(seqStack *s,bool (*pfun)());


*********************************************************/
bool initStack(SeqStack *s)
{
if(NULL == s)
{
puts("initStack error");
return false;
}
s->base = (ElemType *)malloc(STACK_INIT_SIZE * sizeof(ElemType));
if(NULL == s->base)
{
puts("initStack fail");
return false;
}
s->top = s->base;
s->size = STACK_INIT_SIZE;
return true;
}


bool destroyStack(SeqStack *s)
{
if(NULL == s)
{
puts("initStack error");
return false;
}
free(s->base);
s->base = NULL;
s->top = NULL;
s->size = 0;
return true;
}


bool clearStack(SeqStack *s)
{
if(NULL == s)
{
puts("initStack error");
return false;
}
s->top = s->base;
s->size = 0;
return true;
}


bool stackIsEmpty(SeqStack *s)
{
if(NULL == s)
{
puts("initStack error");
exit(1);
}

return s->top == s->base;
}


int getStackLength(SeqStack *s)
{
if(NULL == s)
{
puts("initStack error");
return false;
}

return s->top - s->base;
}


bool getTop(SeqStack *s, ElemType *elem)
{
if((NULL == s)||(NULL == elem))
{
puts("initStack error");
return false;
}
if(s->size == 0)
{
puts("Stack is empty!");
return false;
}
*elem = *(s->top-1);
}


bool push(SeqStack *s,ElemType elem)
{
//指针判空
if(NULL == s)
{
puts("initStack error");
return false;
}
//判断栈是否初始化
if(NULL == s->base)
{
puts("No Stack!");
return false;
}
//如果栈已满
//不能使用下面语句判断，因为栈可以动态增加空间
//if(s->size == STACK_INIT_SIZE)
//需要使用realloc,重新分配连续空间
if(s->top - s->base >=s->size)
{
s->base = (ElemType *)realloc(s->base,(s->size + STACKINCREMENT) * sizeof(ElemType));
if(s->base == NULL)
{
puts("increment memory fail!");
return false;
}
s->top = s->base + s->size;
s->size += STACKINCREMENT;
}

*(s->top)++ = elem;
return true;
}


bool pop(SeqStack *s,ElemType *elem)
{
//入参指针判空
if((NULL == s)||(NULL == elem))
{
return false;
}
//栈是否初始化
if(NULL == s->base)
{
return false;
}
//栈是否为空
if(s->top == s->base)
{
return false;
}
*elem = *(--s->top);
return true;
}


bool stackTraverse(SeqStack *s,void (*pfun)(ElemType elem))
{
ElemType * current;
if(NULL == s)
{
return false;
}
current = s->top;
while(current-- > s->base)
{
(*pfun)(*current);
}
return true;
}


void printStack(ElemType elem)
{
static int count = 0;


printf("%4d", elem);
if(++count%10 == 0)
{
puts(" ");
count = 0;
}
}


简单测试程序main.c

#include <stdio.h>
#include "seqStack.h"


int main(void)
{
SeqStack sqStack;
int i;
ElemType value;

if(initStack(&sqStack))
{
puts("/************Test initStack****************/");
printf("Stack size is %d\n",sqStack.size);
}

if(stackIsEmpty(&sqStack))
{
puts("/*****************Test stackIsEmpty*************/");
}

for(i =0;i<110;i++)
{
push(&sqStack, i);
}
puts("/********************Test push 110 number && stackTraverse*************/");
stackTraverse(&sqStack,printStack);

puts("Test getTop:");
getTop(&sqStack, &value);
printStack(value);
puts(" ");

puts("Test pop 15 number");
for(i =0;i<15;i++)
{
pop(&sqStack, &value);
printf("value %d is %d\n",i,value);
}
getTop(&sqStack,&value);
printf("Now the top is %d\n",value);

puts("/*********************Test clearStack*************************/");
clearStack(&sqStack);
if(stackIsEmpty(&sqStack))
{
puts("stack is empty!");
}
puts("/****************Test destroyStack:**************/");
if(destroyStack(&sqStack))
{
if(!push(&sqStack,i))
{
puts("push fail!");
}
}


return 0;
}