24.c

用链表结构完成堆栈的任务

#include<stdio.h>
#define null 0

typedef struct node  /*定义结构体*/
{
int data;
struct node * next;
}slnode;


void initiatels(slnode *h)
{
h=(slnode*)malloc(sizeof(slnode));
h->next=null;
}

void pushls(slnode *h,int x)
{
slnode *p;
p=(slnode*)malloc(sizeof(slnode));
p->data=x;
p->next=h->next;
h->next=p;
}

main()
{
int ch;
slnode *h,*p;
initiatels(h);
printf(">");
scanf("%d",&ch);
while(ch!=-1)
{
pushls(h,ch);
scanf("%d",&ch);
}
p=h->next;


while(p->next!=null)
{
p=h->next;
h->next=p->next;
ch=p->data;
printf("%d",ch);
}

printf("\n");
}