<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[DokiDokiflechazo的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/DokiDokiflechazo</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; DokiDokiflechazo]]></copyright><item><title><![CDATA[哈夫曼树构建过程]]></title><link>https://blog.youkuaiyun.com/DokiDokiflechazo/article/details/144720310</link><guid>https://blog.youkuaiyun.com/DokiDokiflechazo/article/details/144720310</guid><author>DokiDokiflechazo</author><pubDate>Wed, 25 Dec 2024 15:12:40 +0800</pubDate><description><![CDATA[从姓名liyixuan”中提取去重字母得到liyxuan字母频率l3i6y2x4u5a7n8//最小堆的结构int size;// 堆的当前元素数量// 堆的最大容量上述定义中的是抽象数据类型，本节专门使用最小堆来构造哈夫曼树，因此要改成哈夫曼 树的类型：//最小堆的结构//指向HuffmanTree类型的指针数组，每一个元素都是指向哈夫曼树结点的指针int size;]]></description><category></category></item><item><title><![CDATA[链表的教程]]></title><link>https://blog.youkuaiyun.com/DokiDokiflechazo/article/details/144652221</link><guid>https://blog.youkuaiyun.com/DokiDokiflechazo/article/details/144652221</guid><author>DokiDokiflechazo</author><pubDate>Sun, 22 Dec 2024 20:54:48 +0800</pubDate><description><![CDATA[display_text(800,200,_T("结点申请内存: s = (LinkList)malloc(sizeof(Node));display_text(800,200,_T("找到待删除结点s，p是s的前一个结点，s = p->next;display_text(800,300,_T("将s的后继赋值给p的后继，p->next = s->next;/*  生成新结点(C语言标准函数) */display_text(800,400,_T("结点s已经释放，free(s)"));]]></description><category></category></item></channel></rss>