<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[CaptainUniverse_的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/CaptainUniverse_</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; CaptainUniverse_]]></copyright><item><title><![CDATA[数据结构与算法（C语言实现） 7-8.查找和排序算法的综合应用]]></title><link>https://blog.youkuaiyun.com/CaptainUniverse_/article/details/125211738</link><guid>https://blog.youkuaiyun.com/CaptainUniverse_/article/details/125211738</guid><author>CaptainUniverse_</author><pubDate>Thu, 09 Jun 2022 21:59:04 +0800</pubDate><description><![CDATA[数据结构与算法（C语言实现） 实验七-八：查找和排序算法的综合应用]]></description><category></category></item><item><title><![CDATA[数据结构与算法（C语言实现） 6.图的综合应用（邻接表有向图）]]></title><link>https://blog.youkuaiyun.com/CaptainUniverse_/article/details/124798403</link><guid>https://blog.youkuaiyun.com/CaptainUniverse_/article/details/124798403</guid><author>CaptainUniverse_</author><pubDate>Mon, 16 May 2022 14:05:27 +0800</pubDate><description><![CDATA[数据结构与算法（C语言实现） 实验六：图的综合应用（邻接表有向图）]]></description><category></category></item><item><title><![CDATA[数据结构与算法（C语言实现） 6.图的综合应用（邻接矩阵有向图）]]></title><link>https://blog.youkuaiyun.com/CaptainUniverse_/article/details/124791986</link><guid>https://blog.youkuaiyun.com/CaptainUniverse_/article/details/124791986</guid><author>CaptainUniverse_</author><pubDate>Mon, 16 May 2022 02:21:16 +0800</pubDate><description><![CDATA[数据结构与算法（C语言实现） 实验六：图的综合应用（邻接矩阵有向图）]]></description><category></category></item><item><title><![CDATA[国际C语言混乱代码大赛（IOCCC）1988年获奖作品]]></title><link>https://blog.youkuaiyun.com/CaptainUniverse_/article/details/124777595</link><guid>https://blog.youkuaiyun.com/CaptainUniverse_/article/details/124777595</guid><author>CaptainUniverse_</author><pubDate>Sun, 15 May 2022 01:37:42 +0800</pubDate><description><![CDATA[国际C语言混乱代码大赛（IOCCC, The International Obfuscated C Code Contest）是一项国际编程赛事，从1984年开始，每年举办一次（1997年、1999年、2002年、2003年和2006年例外）。目的是写出最有创意的最让人难以理解的C语言代码。]]></description><category></category></item><item><title><![CDATA[14 栈的运用（OJ通过）]]></title><link>https://blog.youkuaiyun.com/CaptainUniverse_/article/details/124743483</link><guid>https://blog.youkuaiyun.com/CaptainUniverse_/article/details/124743483</guid><author>CaptainUniverse_</author><pubDate>Fri, 13 May 2022 00:37:08 +0800</pubDate><description><![CDATA[描述：构建一个栈，根据指令进行相关操作。
指令 1，输入一个整数 num；指令 2，输出栈顶元素；指令 3，弹出栈顶元素。]]></description><category></category></item><item><title><![CDATA[13 梦幻布丁（OJ没有测试用例）]]></title><link>https://blog.youkuaiyun.com/CaptainUniverse_/article/details/124743415</link><guid>https://blog.youkuaiyun.com/CaptainUniverse_/article/details/124743415</guid><author>CaptainUniverse_</author><pubDate>Fri, 13 May 2022 00:32:34 +0800</pubDate><description><![CDATA[描述：N 个布丁摆成一行,进行 M 次操作.每次将某个颜色的布丁全部变成另一种颜色的,
然后再询问当前一共有多少段颜色.例如颜色分别为 1,2,2,1 的四个布丁一共有 3段颜色]]></description><category></category></item><item><title><![CDATA[12 数据结构栈（OJ通过）]]></title><link>https://blog.youkuaiyun.com/CaptainUniverse_/article/details/124743372</link><guid>https://blog.youkuaiyun.com/CaptainUniverse_/article/details/124743372</guid><author>CaptainUniverse_</author><pubDate>Fri, 13 May 2022 00:28:03 +0800</pubDate><description><![CDATA[描述：如果有 n 个元素进栈，那么有多少种方式出栈呢？]]></description><category></category></item><item><title><![CDATA[11 吐泡泡（OJ通过）]]></title><link>https://blog.youkuaiyun.com/CaptainUniverse_/article/details/124743311</link><guid>https://blog.youkuaiyun.com/CaptainUniverse_/article/details/124743311</guid><author>CaptainUniverse_</author><pubDate>Fri, 13 May 2022 00:25:03 +0800</pubDate><description><![CDATA[描述：小鱼儿吐泡泡，嘟嘟嘟冒出来。小鱼儿会吐出两种泡泡：大泡泡"O"，小泡泡"o"。两个相邻的小泡泡会融成一个大泡泡,两个相邻的大泡泡会爆掉。（是的你没看错，小气泡和大气泡不会产生任何变化的，原因我也不知道。）例如:ooOOoooO 经过一段时间以后会变成 oO。]]></description><category></category></item><item><title><![CDATA[10 括号匹配（OJ通过）]]></title><link>https://blog.youkuaiyun.com/CaptainUniverse_/article/details/124743254</link><guid>https://blog.youkuaiyun.com/CaptainUniverse_/article/details/124743254</guid><author>CaptainUniverse_</author><pubDate>Fri, 13 May 2022 00:20:41 +0800</pubDate><description><![CDATA[描述：给出一个仅包含字符'(',')','{','}','['和']',的字符串，判断给出的字符串是否是合法的括号序列括号必须以正确的顺序关闭，"()"和"()[]{}"都是合法的括号序列，但"(]"和"([)]"不合法。]]></description><category></category></item><item><title><![CDATA[9 顺序表元素移动（OJ通过）]]></title><link>https://blog.youkuaiyun.com/CaptainUniverse_/article/details/124743220</link><guid>https://blog.youkuaiyun.com/CaptainUniverse_/article/details/124743220</guid><author>CaptainUniverse_</author><pubDate>Fri, 13 May 2022 00:17:59 +0800</pubDate><description><![CDATA[描述：已知线性表（a1 a2 a3 …an）按顺序存于内存，每个元素都是整数，试设计用
最少时间把所有值为负数的元素移到全部正数值元素前边的算法：
例：（x,-x,-x,x,x,-x …x）变为（-x,-x,-x…x,x,x）。]]></description><category></category></item><item><title><![CDATA[8 字符串模式匹配（OJ通过）]]></title><link>https://blog.youkuaiyun.com/CaptainUniverse_/article/details/124743157</link><guid>https://blog.youkuaiyun.com/CaptainUniverse_/article/details/124743157</guid><author>CaptainUniverse_</author><pubDate>Fri, 13 May 2022 00:15:10 +0800</pubDate><description><![CDATA[描述：设 s、t 为两个字符串，分别放在两个一维数组中，m、n 分别为其长度，判断 t
是否为 s 的子串。如果是，输出子串所在位置（第一个字符），否则输出 0。]]></description><category></category></item><item><title><![CDATA[7 反转链表（OJ通过）]]></title><link>https://blog.youkuaiyun.com/CaptainUniverse_/article/details/124743104</link><guid>https://blog.youkuaiyun.com/CaptainUniverse_/article/details/124743104</guid><author>CaptainUniverse_</author><pubDate>Fri, 13 May 2022 00:10:51 +0800</pubDate><description><![CDATA[描述：输入一个链表，反转链表后，输出新链表。]]></description><category></category></item><item><title><![CDATA[6 单链表删除结点（OJ通过）]]></title><link>https://blog.youkuaiyun.com/CaptainUniverse_/article/details/124743038</link><guid>https://blog.youkuaiyun.com/CaptainUniverse_/article/details/124743038</guid><author>CaptainUniverse_</author><pubDate>Fri, 13 May 2022 00:06:46 +0800</pubDate><description><![CDATA[描述：试编写在带头结点的单链表中删除（一个）最小值结点的（高效）算法。void
delete（Linklist &amp;L）]]></description><category></category></item><item><title><![CDATA[5 链表合并（OJ通过）]]></title><link>https://blog.youkuaiyun.com/CaptainUniverse_/article/details/124742958</link><guid>https://blog.youkuaiyun.com/CaptainUniverse_/article/details/124742958</guid><author>CaptainUniverse_</author><pubDate>Fri, 13 May 2022 00:04:11 +0800</pubDate><description><![CDATA[描述：假设有两个按元素值递增次序排列的线性表，均以单链表形式存储。请编写算法将这两个单链表归并为一个按元素值递减次序排列的单链表，并要求利用原来两个单链表的结点存放归并后的单链表。]]></description><category></category></item><item><title><![CDATA[4 入栈、出栈序列（OJ通过）]]></title><link>https://blog.youkuaiyun.com/CaptainUniverse_/article/details/124742911</link><guid>https://blog.youkuaiyun.com/CaptainUniverse_/article/details/124742911</guid><author>CaptainUniverse_</author><pubDate>Thu, 12 May 2022 23:58:54 +0800</pubDate><description><![CDATA[描述：输入两个整数序列，第一个序列表示栈的压入顺序，请判断第二个序列是否可能
为该栈的弹出顺序。假设压入栈的所有数字均不相等。例如序列 1,2,3,4,5 是某栈的压入顺序，序列 4,5,3,2,1 是该压栈序列对应的一个弹出序列，但 4,3,5,1,2就不可能是该压栈序列的弹出序列。]]></description><category></category></item><item><title><![CDATA[3 字符串变形（OJ通过）]]></title><link>https://blog.youkuaiyun.com/CaptainUniverse_/article/details/124742851</link><guid>https://blog.youkuaiyun.com/CaptainUniverse_/article/details/124742851</guid><author>CaptainUniverse_</author><pubDate>Thu, 12 May 2022 23:53:25 +0800</pubDate><description><![CDATA[描述：对于一个长度为 n 字符串，我们需要对它做一些变形。首先这个字符串中包含着一些空格，就像"Hello World"一样，然后我们要做的是把这个字符串中由空格隔开的单词反序，同时反转每个字符的大小写。比如"Hello World"变形后就变成了"wORLD hELLO"。数据范围: 1≤n≤10^6 , 字符串中包括大写英文字母、小写英文字母、空格。进阶：空间复杂度 O(n) ， 时间复杂度 O(n)]]></description><category></category></item><item><title><![CDATA[2 单链表结点删除（OJ通过）]]></title><link>https://blog.youkuaiyun.com/CaptainUniverse_/article/details/124742780</link><guid>https://blog.youkuaiyun.com/CaptainUniverse_/article/details/124742780</guid><author>CaptainUniverse_</author><pubDate>Thu, 12 May 2022 23:46:58 +0800</pubDate><description><![CDATA[描述：本题要求实现两个函数，分别将读入的数据存储为单链表、将链表中所有存储了
某给定值的结点删除。]]></description><category></category></item><item><title><![CDATA[1 奇数值结点链表（OJ通过）]]></title><link>https://blog.youkuaiyun.com/CaptainUniverse_/article/details/124742703</link><guid>https://blog.youkuaiyun.com/CaptainUniverse_/article/details/124742703</guid><author>CaptainUniverse_</author><pubDate>Thu, 12 May 2022 23:42:03 +0800</pubDate><description><![CDATA[描述：本题要求实现两个函数，分别将读入的数据存储为单链表、将链表中奇数值的结点重新组成一个新的链表。]]></description><category></category></item><item><title><![CDATA[严肃地为Code开光 防止一切BUG]]></title><link>https://blog.youkuaiyun.com/CaptainUniverse_/article/details/124514562</link><guid>https://blog.youkuaiyun.com/CaptainUniverse_/article/details/124514562</guid><author>CaptainUniverse_</author><pubDate>Sat, 30 Apr 2022 16:24:35 +0800</pubDate><description><![CDATA[严肃地为Code开光 防止一切BUG]]></description><category></category></item><item><title><![CDATA[数据结构与算法（C语言实现） 5.哈夫曼树的设计及实现]]></title><link>https://blog.youkuaiyun.com/CaptainUniverse_/article/details/124441321</link><guid>https://blog.youkuaiyun.com/CaptainUniverse_/article/details/124441321</guid><author>CaptainUniverse_</author><pubDate>Wed, 27 Apr 2022 01:41:53 +0800</pubDate><description><![CDATA[数据结构与算法（C语言实现） 实验五：哈夫曼树的设计及实现]]></description><category></category></item></channel></rss>