head.h

一个自写的STACK栈的结构

#include <malloc.h>
#include <stdio.h>
#define FALSE 0
#define ERROR 0
#define OK 1
#define TRUE 1
#define STACK_INIT_SIZE 30
#define STACK_ADD 5
typedef int Status;
struct Stack
{
char *top;
char *base;
int ssize;
/*struct m *next;*/
};
void msg(char *c){
	printf("%s\n",c);
}
struct Stack *InitS(struct Stack *s){
	s->base=(char *)malloc(STACK_INIT_SIZE*sizeof(char));
	if(!s->base) msg("init error");
	s->top=s->base;
    s->ssize=STACK_INIT_SIZE;
//	msg("init success");
    return s;
}
void DestS(struct Stack *s){
	s->base=NULL;
	s->top=s->base;
	//msg("Destory Seccuss");
}/**/
void Push(struct Stack *s,char c)
{
	if (s->top-s->base >= s->ssize) {
		s->base = (char *)realloc(s->base ,(s->ssize +STACK_ADD)*sizeof(char));
		if(!s->base ) msg("m error ");
		s->top = s->base + s->ssize ;
		s->ssize += STACK_ADD;
	}
	*(s->top) = c;
	s->top++;
	//msg("push success");
}/**/

struct Stack *Pop(struct Stack *s){
	if (s->top ==s->base ) msg("pop stack error");
//	else
		s->top--;
//	msg("pop success");
	return s;

}
char Gettop(struct Stack *s){
//if (s->top ==s->base ) msg("gettop stack error");
return *(s->top -1);
}
Status Sempty(struct Stack *s){
	if (s->top ==s->base || s->top==NULL) 
		return TRUE; 
	else 
		return FALSE;
}