链表结点的删除

最新推荐文章于 2025-03-19 20:07:34 发布

萧铭苦学编程

最新推荐文章于 2025-03-19 20:07:34 发布

阅读量580

点赞数

分类专栏：数据结构文章标签：链表算法数据结构

本文链接：https://blog.youkuaiyun.com/weixin_51972895/article/details/131985544

版权

数据结构专栏收录该内容

10 篇文章

订阅专栏

文章展示了如何在C语言中删除链表节点，包括当头节点被删除和非头节点被删除的情况。提供了动态链表（使用malloc创建）和静态链表的节点删除函数，并通过示例代码解释了free函数如何释放已删除节点的内存。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

注意：：：free(p);free函数的使用范围必须是malloc()函数出来的内存空间才能够把这个垃圾内存给free掉。

链表结点的删除分为两种情况：头结点被删除导致头发生改变；其他结点被删除。

静态链表的结点删除：

  1 #include<stdio.h>
  2 
  3 struct test
  4 {
  5    int data;
  6    struct test *next;
  7 };
  8 
  9 void printLink(struct test *head)
 10 {
 11   struct test *point = head;
 12   while(point !=NULL ){
 13       printf("%d ",point->data);
 14       point = point->next;
 15   }
 16   putchar('\n');
 17 }
 18 struct test* deleteNode(struct test *head,int data)
 19 {
 20   struct test *point=head;
 21 
 22   if(head->data==data){
 23      head=head->next;
 24      return head;
 25   }
 26   while(point->next!=NULL){
 27      if(point->next->data==data){
 28         point->next=point->next->next;
 29         return head;
 30      }else{
 31         point=point->next;
 32      }
 33   }
 34   return head;
 35 }
 36 
 37 int main()
 38 {
 39   struct test *head=NULL;
 40   struct test t1 ={1,NULL};
 41   struct test t2 ={2,NULL};
 42   struct test t3 ={3,NULL};
 43   struct test t4 ={4,NULL};
 44   struct test t5 ={5,NULL};
 45 
 46   t1.next =&t2;
 47   t2.next =&t3;
 48   t3.next =&t4;
 49   t4.next =&t5;
 50 
 51   head=&t1;
 52   printLink(head);
 53   head=deleteNode(head,1);
 54   printLink(head);
 55 
 56   head=deleteNode(head,3);
 57   printLink(head);
 58   return 0;
 59 }
 60

动态链表结点删除

  1 #include<stdio.h>
  2 #include<stdlib.h>
  3 
  4 struct test
  5 {
  6    int data;
  7    struct test *next;
  8 };
  9 
 10 void printLink(struct test *head)
 11 {
 12   struct test *point = head;
 13   while(point !=NULL ){
 14       printf("%d ",point->data);
 15       point = point->next;
 16   }
 17   putchar('\n');
 18 }
 19 struct test* deleteNode(struct test *head,int data)
 20 {
 21   struct test *point=head;
 22 
 23   if(head->data==data){
 24      head=point->next;
 25      free(point);        //warning free()weizhi.
 26      return head;
 27   }
 28   while(point->next!=NULL){
 29      if(point->next->data==data){
 30         point->next=point->next->next;
 31         return head;
 32      }else{
 33         point=point->next;
 34      }
 35   }
 36   return head;
 37 }
 38 
 39 int main()
 40 {
 41   struct test *head=(struct test*)malloc(sizeof(struct test));
 42   head->data=1;
 43 
 44   struct test t2 ={2,NULL};
 45   struct test t3 ={3,NULL};
 46   struct test t4 ={4,NULL};
 47   struct test t5 ={5,NULL};
 48 
 49   head->next=&t2;
 50   t2.next =&t3;
 51   t3.next =&t4;
 52   t4.next =&t5;
 53 
 54   printLink(head);
 55   head=deleteNode(head,1);
 56   printLink(head);
 57 
 58   head=deleteNode(head,3);
 59   printLink(head);
 60   return 0;
 61 }
 62