dan.c

用尾插法建立单链表

#include<stdio.h>
#define null 0


typedef struct node
{
int data;
struct node*next;
}slnode;


void  initiate(slnode**h)
{
*h=(slnode*)malloc(sizeof(slnode));

(*h)->next=null;


}


main()
{
int i,x;
slnode*p;
slnode*q;
slnode*s;
initiate(&p);
q=p;
s=(slnode*)malloc(sizeof(slnode));
q->next=s;
q=s;
q->next=NULL;
//q=q->next;
//s->next=NULL;

i=1;
printf("ch%d=",i);
scanf("%d",&x);
while(x!=-1)
{ s=(slnode*)malloc(sizeof(slnode));
  s->data=x;
  q->next=s;
  q=s;
  q->next=NULL;
  //q=q->next;
  //s->next=null;

  i++,
  printf("ch%d=",i);
  scanf("%d",&x);
}
p=p->next;
while(p->next!=null)
{
printf("--%d",p->next->data);
p=p->next;
}
printf("\n");
}