lianbiao7.c

链表的测试 使用方式 添加,删除方法的实现

#include "stdio.h"
#define null NULL
struct links
{
  int num;
  struct links *next;
};
typedef struct links *link;
link e,head;
void start()
{
  e->num=null;
  e->next=null;
  head=e;
}
void add(int number)  /*在末尾插入number*/
{
  e->next=malloc(sizeof(link));
  e=e->next;
  e->num=number;
  e->next=null;
}
void putout()          /*打印链表*/
{
  link s=head;
  while(s->next!=null)
  {
    s=s->next;
    printf("%d\t",s->num);
  }
  printf("\n\n");
}
void remove_num(int n) /*删除第n个数*/
{
  link s=head;
  link p;
  int i=1;
  while(i<n)
  {
    s=s->next;
    i++;
    if(s->next==null){printf("\n\nError!\nN=%d is Too big!\n",n); return;}
  }
  p=s->next;
  s->next=p->next;
  free(p);
}
main()
{
  int i;
  start();
  for(i=0;i<10;i++) add(i);
  putout();
  remove_num(10);       /*删除第四个数*/
  putout();
  remove_num(10);
  putout();
  getch();
}