<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[dev_cc_的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/dev_cc_</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; dev_cc_]]></copyright><item><title><![CDATA[10.1常见的排序算法]]></title><link>https://blog.youkuaiyun.com/dev_cc_/article/details/140067767</link><guid>https://blog.youkuaiyun.com/dev_cc_/article/details/140067767</guid><author>dev_cc_</author><pubDate>Sat, 29 Jun 2024 17:48:55 +0800</pubDate><description><![CDATA[【代码】10.1常见的排序算法。]]></description><category></category></item><item><title><![CDATA[7.1图的遍历]]></title><link>https://blog.youkuaiyun.com/dev_cc_/article/details/140067614</link><guid>https://blog.youkuaiyun.com/dev_cc_/article/details/140067614</guid><author>dev_cc_</author><pubDate>Sat, 29 Jun 2024 17:43:55 +0800</pubDate><description><![CDATA[【代码】7.1图的遍历。]]></description><category></category></item><item><title><![CDATA[数据结构-＞9.1顺序查找和二分查找]]></title><link>https://blog.youkuaiyun.com/dev_cc_/article/details/139248170</link><guid>https://blog.youkuaiyun.com/dev_cc_/article/details/139248170</guid><author>dev_cc_</author><pubDate>Mon, 27 May 2024 21:24:17 +0800</pubDate><description><![CDATA[【代码】数据结构-＞9.1顺序查找和二分查找。]]></description><category></category></item><item><title><![CDATA[数据结构-＞9.2哈希表]]></title><link>https://blog.youkuaiyun.com/dev_cc_/article/details/139247570</link><guid>https://blog.youkuaiyun.com/dev_cc_/article/details/139247570</guid><author>dev_cc_</author><pubDate>Mon, 27 May 2024 21:01:41 +0800</pubDate><description><![CDATA[1.哈希表内在就是利用空间换时间，也就是定义的空间足够大，可以只需要一次查询就能找到要找的元素内容。2.实现：（1）创建一个包含length，elements元素的结构体，length定义一个大小合适的空间，待会儿分配给elements相应的空间。（2）利用ListPtr指针指向一个包含有key，value的结点，也就是给输入的内容存储在elements.key和elements.value中。（3）只讲一下结构怎么定义，算法就不详细说明了。]]></description><category></category></item><item><title><![CDATA[数据结构-6.3N后问题]]></title><link>https://blog.youkuaiyun.com/dev_cc_/article/details/139014781</link><guid>https://blog.youkuaiyun.com/dev_cc_/article/details/139014781</guid><author>dev_cc_</author><pubDate>Fri, 17 May 2024 23:28:09 +0800</pubDate><description><![CDATA[代码如下（示例）：
2.读入数据
代码如下（示例）：]]></description><category></category></item><item><title><![CDATA[数据结构-6.1二叉树的构建与遍历]]></title><link>https://blog.youkuaiyun.com/dev_cc_/article/details/139002320</link><guid>https://blog.youkuaiyun.com/dev_cc_/article/details/139002320</guid><author>dev_cc_</author><pubDate>Fri, 17 May 2024 13:37:03 +0800</pubDate><description><![CDATA[首先写出构建结点和队列的数据结构，然后写出入队，出队的函数，出队返回值为队列的头指针地址，constructBTNode()将输入的字符串的字符给纳入结点element之中，然后StringToBTree()把队列中的元素用left，right指针连接起来构成二叉树，levelwise()函数对二叉树进行层次遍历，后面的preorder(),inorder(),postorder()是对前中后序输出。]]></description><category></category></item><item><title><![CDATA[数据结构3.7--循环队列]]></title><link>https://blog.youkuaiyun.com/dev_cc_/article/details/138585540</link><guid>https://blog.youkuaiyun.com/dev_cc_/article/details/138585540</guid><author>dev_cc_</author><pubDate>Wed, 08 May 2024 20:39:07 +0800</pubDate><description><![CDATA[【代码】数据结构3.7--循环队列。]]></description><category></category></item><item><title><![CDATA[数据结构3.6--链队列]]></title><link>https://blog.youkuaiyun.com/dev_cc_/article/details/138581915</link><guid>https://blog.youkuaiyun.com/dev_cc_/article/details/138581915</guid><author>dev_cc_</author><pubDate>Wed, 08 May 2024 18:27:47 +0800</pubDate><description><![CDATA[【代码】数据结构3.6--链队列。]]></description><category></category></item><item><title><![CDATA[3.2 作业-括号匹配]]></title><link>https://blog.youkuaiyun.com/dev_cc_/article/details/138492064</link><guid>https://blog.youkuaiyun.com/dev_cc_/article/details/138492064</guid><author>dev_cc_</author><pubDate>Mon, 06 May 2024 13:38:43 +0800</pubDate><description><![CDATA[【代码】3.2 作业-括号匹配。]]></description><category></category></item><item><title><![CDATA[3.2汉诺塔作业]]></title><link>https://blog.youkuaiyun.com/dev_cc_/article/details/138315376</link><guid>https://blog.youkuaiyun.com/dev_cc_/article/details/138315376</guid><author>dev_cc_</author><pubDate>Mon, 29 Apr 2024 15:45:04 +0800</pubDate><description><![CDATA[【代码】3.2汉诺塔作业。]]></description><category></category></item><item><title><![CDATA[3.1栈-作业]]></title><link>https://blog.youkuaiyun.com/dev_cc_/article/details/138202322</link><guid>https://blog.youkuaiyun.com/dev_cc_/article/details/138202322</guid><author>dev_cc_</author><pubDate>Thu, 25 Apr 2024 23:14:25 +0800</pubDate><description><![CDATA[【代码】3.1栈-作业。]]></description><category></category></item><item><title><![CDATA[3.1多项式加法-作业]]></title><link>https://blog.youkuaiyun.com/dev_cc_/article/details/138202082</link><guid>https://blog.youkuaiyun.com/dev_cc_/article/details/138202082</guid><author>dev_cc_</author><pubDate>Thu, 25 Apr 2024 23:02:01 +0800</pubDate><description><![CDATA[【代码】3.1多项式加法-作业。]]></description><category></category></item><item><title><![CDATA[2.4静态链表-作业]]></title><link>https://blog.youkuaiyun.com/dev_cc_/article/details/138012861</link><guid>https://blog.youkuaiyun.com/dev_cc_/article/details/138012861</guid><author>dev_cc_</author><pubDate>Sat, 20 Apr 2024 22:09:37 +0800</pubDate><description><![CDATA[本节是对静态链表的实现，还是有一些点需要注意，跟动态链表还是有些区别。定义的next和used都是int型，但是开辟空间还是要用malloc库函数。]]></description><category></category></item><item><title><![CDATA[2.3双向链表-作业]]></title><link>https://blog.youkuaiyun.com/dev_cc_/article/details/137976721</link><guid>https://blog.youkuaiyun.com/dev_cc_/article/details/137976721</guid><author>dev_cc_</author><pubDate>Fri, 19 Apr 2024 20:52:43 +0800</pubDate><description><![CDATA[例如：随着人工智能的不断发展，机器学习这门技术也越来越重要，很多人都开启了学习机器学习，本文就介绍了机器学习的基础内容。提示：以下是本篇文章正文内容，下面案例可供参考。]]></description><category></category></item><item><title><![CDATA[作业第二节：单链表]]></title><link>https://blog.youkuaiyun.com/dev_cc_/article/details/137564203</link><guid>https://blog.youkuaiyun.com/dev_cc_/article/details/137564203</guid><author>dev_cc_</author><pubDate>Tue, 09 Apr 2024 19:21:30 +0800</pubDate><description><![CDATA['''char data;while (p!= NULL) {= NULL) {i++) {return;free(q);');int main()''']]></description><category></category></item><item><title><![CDATA[作业：线性表2.1]]></title><link>https://blog.youkuaiyun.com/dev_cc_/article/details/137433564</link><guid>https://blog.youkuaiyun.com/dev_cc_/article/details/137433564</guid><author>dev_cc_</author><pubDate>Sat, 06 Apr 2024 17:41:17 +0800</pubDate><description><![CDATA[i++) {i++) {return;return;return;i--) {int i;for (i = 0;i < 5;i++) {return -1;return -1;i++) {i++) {]]></description><category></category></item></channel></rss>