链表的删除

来源：互联网发布：淘宝手工食品放哪类目编辑：程序博客网时间：2024/06/05 12:01
给定一个元素，删除链表中所有这个元素
#include<stdio.h>  #include<stdlib.h>  typedef struct _Node  {      int data;      struct _Node *next;  }Node;    typedef struct _list{      Node *head;  }List;    void add(List *pList,int number)  {      Node *p=(Node*)malloc(sizeof(Node));      p->data=number;      p->next=NULL;      Node *last=pList->head;      if(last)      {          while(last->next)          {              last=last->next;          }          last->next=p;      }      else           pList->head=p;  }      void add2(List *pList,int number)  {      Node *p=(Node*)malloc(sizeof(Node));      p->data=number;      p->next=pList->head;      pList->head=p;  }  void add3(List *pList,int number)  {      Node *p=(Node*)malloc(sizeof(Node));      p->data=number;      p->next=NULL;      if(pList->head==NULL||p->data<pList->head->data)      {           p->next=pList->head;           pList->head=p;      }      else      {          Node *q=pList->head;          while(q->next&&p->data>q->next->data)          {              q=q->next;          }          if(q->next==NULL)          {              q->next=p;          }          else          {              p->next=q->next;              q->next=p;          }      }        }void deletel(List *pList,int m){if(pList->head->data==m){pList->head=pList->head->next;}Node *p=pList->head;while(p->next){if(p->next->data==m){Node *q;q=p->next;p->next=q->next;free(q);}else{p=p->next;}}}void showL(List *pList)  {      Node *p;      for(p=pList->head;p;p=p->next)      {    if(p->next==NULL)printf("%d\n",p->data);else          printf("%d ",p->data);      }        }  int count(List *pList){int t=0; Node *p;      for(p=pList->head;p;p=p->next)      {        t++;    }        return t;}  int main()  {      List L;      L.head=NULL;      int n,temp,t;    scanf("%d",&n);      for(int i=0;i<n;i++)      {          scanf("%d",&temp);          add(&L,temp);      }     int m;      scanf("%d",&m);     t=count(&L);    printf("%d\n",t);    showL(&L);    deletel(&L,m);     t=count(&L);printf("%d\n",t);     showL(&L);    }
阅读全文
0 0