链表.c

制作一个单向链表

#include<stdio.h>
#include<malloc.h>
typedef struct note
{long data;
 struct node *next;
}NODE;

int n;
NODE *creat(void);
void print(NODE*head);
NODE *del(NODE *head,long num);
NODE *forceinsert(NODE *head,NODE*insert1,long data1);
NODE *lastinsert(NODE *head,NODE*insert,long data2);
int main()
{
 NODE*head,insert1,insert;
 long del_num,data1,data2;
 printf("输入数据（以0结束）:\n");
 head=creat();
 print(head);

 printf("\n输入要删除的数据:");
 scanf("%ld",&del_num);
 head=del(head,del_num);
 print(head);

 printf("\n输入要在前面插入数据的数据:");
 scanf("%ld",&data1);
 printf("\n输入插入的数据:");
 scanf("%ld",&insert1.data);
 head=forceinsert(head,&insert1,data1);
 print(head);

 printf("\n输入要在后面插入数据的数据:");
 scanf("%ld",&data2);
 printf("\n输入插入的数据:");
 scanf("%ld",&insert.data);
 head=lastinsert(head,&insert,data2);
 print(head);
}

NODE *creat(void)
{
 NODE *head;
 NODE *p1, *p2;
 n=0;
 p1=p2=(NODE*)malloc(sizeof(NODE));
 scanf("%ld",&p1->data);
 head=NULL;
 while(p1->data!=0)
 {
  n=n+1;
  if(n==1)
   head=p1;
  else
   p2->next=p1;
  p2=p1;
  p1=(NODE*)malloc(sizeof(NODE));
  scanf("%ld",&p1->data);
 } 
 p2->next=NULL;
 return(head);
}


void print(NODE*head)
{
 NODE *p;
 printf("\n此时这%d个数据是:\n",n);
 p=head;
 if(head!=NULL)
  do{
   printf("%ld\n",p->data);
   p=p->next;
  }while(p!=NULL);
}


NODE *del(NODE *head,long num)
{
 NODE *p1, *p2;
 if(head==NULL)
 {
  printf("\n空表!\n");
  return (head);
 }
 p1=head;
 while(num!=p1->data&&p1->next!=NULL)
 {
  p2=p1;
  p1=p1->next;
 }
 if(num==p1->data)
 {
  if(p1==head)
   head=p1->next;
  else
   p2->next=p1->next;
  printf("删除:%ld\n",num);
  n=n-1;
 }
 else
  printf("没找到%ld!\n",num);
 return (head);
}


NODE *forceinsert(NODE *head,NODE*insert1,long data1)
{
 NODE *p0,*p1,*p2;
 p0=p1=p2=(NODE*)malloc(sizeof(NODE));
 p1=head;
 p0=insert1;
 while(data1!=p1->data&&p1->next!=NULL)
 {
  p2=p1;
  p1=p1->next;
 }
 if(data1==p1->data)
 {
  if(p1==head)
  {p0->next=head;
  head=p0;}
  else
  {p2->next=p0;
  p0->next=p1;}
  printf("插入:%ld\n",insert1->data);
  n=n+1;
 }
 return (head);
}

NODE *lastinsert(NODE *head,NODE*insert,long data2)
{
 NODE *p0,*p1,*p2,*p3;
 p0=p1=p2=p3=(NODE*)malloc(sizeof(NODE));
 p1=head;
 p0=insert;
 while(data2!=p1->data&&p1->next!=NULL)
 {
  p2=p1;
  p1=p1->next;
 }
 if(data2==p1->data)
 {
  if(p1->next==NULL)
  {p1->next=p0;p0->next=NULL;}
  else
  {p3=p1->next;
   p1->next=p0; 
   p0->next=p3;}
   printf("插入:%ld\n",insert->data);
   n=n+1;
 }
 return (head);
}