#define OK 1
#define ERROR -1
#define NULL 0
typedef int ElemType;
typedef int Status;
typedef struct Stack_Node
{
ElemType data;
struct Stack_Node *next;
}Stack_Node;
Stack_Node *Init_Link_Stack(void)
{
Stack_Node *top;
top = (Stack_Node *)malloc(sizeof(Stack_Node));
top->next=NULL;
return top;
}
/* 压栈(元素进栈)*/
Status push(Stack_Node *top,ElemType e)
{
Stack_Node * p;
p = (Stack_Node *)malloc(sizeof(Stack_Node));
if(!p) return ERROR;
p->data =e;
p->next = top->next;
top->next =p;
return OK;
}
/* 弹栈(元素出栈)*/
Status pop(Stack_Node *top,ElemType *e)
{
Stack_Node *p;
if(top->next == NULL) return ERROR; /* 栈空,返回错误标志 */
p = top->next; *e = p->data;
top->next = p->next;
free(p);
return OK;
}
/* 测试 */
int main()
{
int i =0,j=0;
Stack_Node *stack;
stack = Init_Link_Stack();
while(i<1000)
{
ElemType e = i;
push(stack,e);
i++;
}
while(j<1000)
{
ElemType e1;
pop(stack,&e1);
printf("%d,",e1);
j++;
}
return 0;
}
以上代码是纯c语言,我是在code::blocks上执行通过的。大家可以参考。