還是參考了別人的程式碼，不過比我自己寫出來的確實是要簡潔的多，不過仍然有不規範的地方，但是仍然值得我學習一下，在敲打的時候也是受到了一定的啟發。

#include <stdio.h>
#include <stdlib.h>
#define FULL 1000
#define EMPTY 0
typedef char data;
struct elem
{
	data d;
	struct elem *next;
};
struct stack
{
	int cnt;
	struct elem *top;
};
void initialize(stack *stk); 
void push(stack *stk, data d);
data pop(stack *stk);
data top(stack *stk);
bool empty(stack *stk);
bool full(stack *stk);
int main(void)
{
	system("pause");
}
void initialize(stack *stk)
{
	stk->cnt = 0;
	stk->top = NULL;
}
void push(stack *stk, data d)
{
	elem *p;
	p = (elem *)malloc(sizeof(elem));
	p->d = d;
	p->next = stk->top;
	stk->top = p;
	stk->cnt++;
}
data pop(stack *stk)
{
	data d;
	elem *p;
	d = stk->top->d;
	p = stk->top;
	stk->top = p->next;
	stk->cnt--;
	free(p);
	return d;
}
data top(stack *stk)
{
	return stk->top->d;
}
bool empty(stack *stk)
{
	return bool(stk->cnt == EMPTY);
}
bool full(stack *stk)
{
	return bool(stk->cnt == FULL);
}