devbox
weixin_40725706
这个屌丝很懒，什么也没留下！
关注作者
热门标签
热门文章
当前位置:   article > 正文

内存泄漏检测、单向链表的操作

作者：weixin_40725706 | 2024-03-23 13:21:19

赞

踩

内存泄漏检测、单向链表的操作

我要成为嵌入式高手之3月19日数据结构第二天！！
————————————————————————————

valgrind内存测试工具

让虚拟机上网、在虚拟机上下载软件，参考笔记：

我要成为嵌入式高手之2月3日Linux高编第一天！！-CSDN博客

上图表示申请了10个空间，释放了10个空间，没有内存泄漏

上图申请了11个空间，释放了10个空间，存在内存泄漏（leaked memory） 

 单向链表逆序

  1. #include "head.h"
  2.  
  3. LINK_LIST *CreateLink()
  4. {
  5.     LINK_LIST *plist = malloc(sizeof(LINK_LIST));
  6.     if (NULL == plist)
  7.     {
  8.         perror("fail to malloc");
  9.         return NULL;
  10.     }
  11.  
  12.     plist->phead = NULL;
  13.     plist->clen = 0;
  14.  
  15.     return plist;
  16. }
  17.  
  18. int LinkSearch(LINK_LIST *plist)
  19. {
  20.     LINK_NODE *ptmp = plist->phead;
  21.  
  22.     while (ptmp != NULL)
  23.     {
  24.         printf("%d\n", ptmp->data);
  25.         ptmp = ptmp->pnext;
  26.     }
  27.  
  28.     printf("len = %d\n", plist->clen);
  29.  
  30.     return 0;
  31. }
  32.  
  33. int PushTailLink(LINK_LIST *plist, DATA_TYPE data)
  34. {
  35.     LINK_NODE *ptmp = plist->phead;
  36.  
  37.     LINK_NODE *pnode = malloc(sizeof(LINK_NODE));
  38.     if (NULL == pnode)
  39.     {
  40.         perror("fail to malloc pnode");
  41.         return -1;
  42.     }
  43.  
  44.     pnode->data = data;
  45.     pnode->pnext = NULL;
  46.  
  47.     if (plist->phead == NULL)
  48.     {
  49.         plist->phead = pnode;
  50.     }
  51.     else
  52.     {
  53.         while (ptmp->pnext != NULL)
  54.         {
  55.             ptmp = ptmp->pnext;
  56.         }
  57.         ptmp->pnext = pnode;
  58.         plist->clen++;
  59.     }
  60.  
  61.     return 0;
  62. }
  63.  
  64. int ReverseLink(LINK_LIST *plist)
  65. {
  66.     if (plist->phead == NULL)
  67.     {
  68.         return -1;
  69.     }
  70.  
  71.     LINK_NODE *ptmp = plist->phead;
  72.     plist->phead = NULL;
  73.     
  74.     LINK_NODE *pinsert = NULL;
  75.     
  76.     while (ptmp != NULL)
  77.     {
  78.         pinsert = ptmp;
  79.         ptmp = ptmp->pnext;
  80.   
  81.         pinsert->pnext = plist->phead;
  82.         plist->phead = pinsert;
  83.     }
  84.     
  85.     return 0;
  86. }
  87.  
  88. int main()
  89. {
  90.     LINK_LIST *plist = NULL;
  91.  
  92.     plist = CreateLink();
  93.     if (NULL == plist)
  94.     {
  95.         return -1;
  96.     }
  97.  
  98.     PushTailLink(plist, 1);
  99.     PushTailLink(plist, 2);
  100.     PushTailLink(plist, 3);
  101.     PushTailLink(plist, 4);
  102.     PushTailLink(plist, 5);
  103.  
  104.     LinkSearch(plist);
  105.  
  106.     ReverseLink(plist);
  107.  
  108.     printf("=========================\n");
  109.     LinkSearch(plist);
  110.  
  111.     return 0;
  112. }

找单向链表的中间节点

 

  1. LINK_NODE *SearchMidNode(LINK_LIST *plist)
  2. {
  3.     LINK_NODE *pfast = plist->phead;
  4.     LINK_NODE *pslow = plist->phead;
  5.  
  6.     while (pfast != NULL)
  7.     {
  8.         pfast = pfast->pnext;
  9.         if (NULL == pfast)
  10.         {
  11.             break;
  12.         }
  13.         pfast = pfast->pnext;
  14.         pslow = pslow->pnext;
  15.  
  16.     }
  17.  
  18.     return pslow;
  19. }

寻找链表倒数第K个结点

  1. LINK_NODE *SearchReNoKNode(LINK_LIST *plist, int k)
  2. {
  3. 	LINK_NODE *pfast = plist->phead;
  4. 	LINK_NODE *pslow = pfast;
  5.     int i = 0;
  6. 	
  7.     for (i = 0; i < k; i++)
  8. 	{
  9. 		if (NULL == pfast)
  10. 		{
  11. 			return NULL;
  12. 		}
  13. 		pfast = pfast->pnext;
  14. 	}
  15.  
  16. 	while (pfast != NULL)
  17. 	{
  18. 		pfast = pfast->pnext;
  19. 		pslow = pslow->pnext;
  20. 	}
  21. 	
  22. 	return pslow;
  23. }

删除指定数据的结点

  1. int DeleteKNode(LINK_LIST *plist, int k)
  2. {
  3.     LINK_NODE *pfree = NULL;
  4.     LINK_NODE *ptmp = NULL;
  5.  
  6.     pfree = plist->phead;
  7.     ptmp = pfree;
  8.     while (pfree != NULL)
  9.     {
  10.         if (pfree->data == k)
  11.         {
  12.             if (plist->phead == pfree)
  13.             {
  14.                 plist->phead = pfree->pnext;
  15.                 free(pfree);
  16.                 plist->clen--;
  17.                 break;
  18.             }
  19.             else
  20.             {
  21.                 ptmp->pnext = pfree->pnext;
  22.                 free(pfree);
  23.                 plist->clen--;
  24.                 break;
  25.             }
  26.         }
  27.         else
  28.         {
  29.             ptmp = pfree;
  30.             pfree = pfree->pnext;
  31.         }
  32.     }
  33.  
  34.     return 0;
  35. }

 链表的插入排序

  1. int InsertSort(LINK_LIST *plist)
  2. {
  3.     LINK_NODE *ptmp = NULL;
  4.     LINK_NODE *pinsert = NULL;
  5.     LINK_NODE *p = NULL;
  6.  
  7.     if (p == NULL || p->pnext == NULL)
  8.     {
  9.         return -1;
  10.     }
  11.  
  12.     ptmp = plist->phead->pnext;
  13.     plist->phead->pnext = NULL;
  14.     pinsert = ptmp;
  15.  
  16.     while (ptmp != NULL)
  17.     {
  18.         pinsert = ptmp;
  19.         ptmp = ptmp->pnext;
  20.  
  21.         if (pinsert->data <= plist->phead->data)
  22.         {
  23.             pinsert->pnext = plist->phead;
  24.             plist->phead = pinsert;
  25.         }
  26.         else
  27.         {
  28.             LINK_NODE *p = plist->phead;
  29.             while (p->pnext != NULL && p->pnext->data < pinsert->data)
  30.             {
  31.                 p = p->pnext;
  32.             }
  33.  
  34.             pinsert->pnext = p->pnext;
  35.             p->pnext = pinsert;
  36.         }
  37.     }
  38.     return 0;
  39. }

 

                                                                                                                                                                                      

声明：本文内容由网友自发贡献，不代表【wpsshop博客】立场，版权归原作者所有，本站不承担相应法律责任。如您发现有侵权的内容，请联系我们。转载请注明出处：https://www.wpsshop.cn/w/weixin_40725706/article/detail/295414
推荐阅读