<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[ccrr7的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/ccrr7</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; ccrr7]]></copyright><item><title><![CDATA[C++基础算法11：SPFA求单源最短路径]]></title><link>https://blog.youkuaiyun.com/ccrr7/article/details/147730562</link><guid>https://blog.youkuaiyun.com/ccrr7/article/details/147730562</guid><author>ccrr7</author><pubDate>Tue, 06 May 2025 11:24:25 +0800</pubDate><description><![CDATA[SPFA，最短路径更快算法]]></description><category></category></item><item><title><![CDATA[C++基础知识1：内建数据类型 vs 自定义数据类型]]></title><link>https://blog.youkuaiyun.com/ccrr7/article/details/147719191</link><guid>https://blog.youkuaiyun.com/ccrr7/article/details/147719191</guid><author>ccrr7</author><pubDate>Mon, 05 May 2025 16:29:15 +0800</pubDate><description><![CDATA[内建数据类型和自定义数据类型区别]]></description><category></category></item><item><title><![CDATA[C++基础算法10：Bellman_Ford]]></title><link>https://blog.youkuaiyun.com/ccrr7/article/details/147711598</link><guid>https://blog.youkuaiyun.com/ccrr7/article/details/147711598</guid><author>ccrr7</author><pubDate>Mon, 05 May 2025 16:20:41 +0800</pubDate><description><![CDATA[Bellman_Ford求解单源最短路径，带负边]]></description><category></category></item><item><title><![CDATA[C++基础算法9：Dijkstra]]></title><link>https://blog.youkuaiyun.com/ccrr7/article/details/147703246</link><guid>https://blog.youkuaiyun.com/ccrr7/article/details/147703246</guid><author>ccrr7</author><pubDate>Sun, 04 May 2025 20:55:54 +0800</pubDate><description><![CDATA[Dijkstra求解路径最短问题]]></description><category></category></item><item><title><![CDATA[（超级详细）发明专利撰写]]></title><link>https://blog.youkuaiyun.com/ccrr7/article/details/147553707</link><guid>https://blog.youkuaiyun.com/ccrr7/article/details/147553707</guid><author>ccrr7</author><pubDate>Sun, 27 Apr 2025 13:35:30 +0800</pubDate><description><![CDATA[专利撰写、专利指导]]></description><category></category></item><item><title><![CDATA[C++数据结构11：拓扑结构]]></title><link>https://blog.youkuaiyun.com/ccrr7/article/details/147551588</link><guid>https://blog.youkuaiyun.com/ccrr7/article/details/147551588</guid><author>ccrr7</author><pubDate>Sun, 27 Apr 2025 11:22:49 +0800</pubDate><description><![CDATA[拓扑数据结构通常指用于表示或分析（如邻接、连通性、层次性）的数据结构，常见于和。其核心是描述元素之间的相对关系而非绝对位置。]]></description><category></category></item><item><title><![CDATA[C++数据结构11：push和push_back]]></title><link>https://blog.youkuaiyun.com/ccrr7/article/details/147522285</link><guid>https://blog.youkuaiyun.com/ccrr7/article/details/147522285</guid><author>ccrr7</author><pubDate>Fri, 25 Apr 2025 22:14:45 +0800</pubDate><description><![CDATA[push和push_back区别]]></description><category></category></item><item><title><![CDATA[C++基础算法8：广度优先搜索BFS]]></title><link>https://blog.youkuaiyun.com/ccrr7/article/details/147521566</link><guid>https://blog.youkuaiyun.com/ccrr7/article/details/147521566</guid><author>ccrr7</author><pubDate>Fri, 25 Apr 2025 22:03:06 +0800</pubDate><description><![CDATA[BFS]]></description><category></category></item><item><title><![CDATA[C++基础算法7：深度优先搜索-Dfs]]></title><link>https://blog.youkuaiyun.com/ccrr7/article/details/147469832</link><guid>https://blog.youkuaiyun.com/ccrr7/article/details/147469832</guid><author>ccrr7</author><pubDate>Thu, 24 Apr 2025 09:46:08 +0800</pubDate><description><![CDATA[深度优先搜索]]></description><category></category></item><item><title><![CDATA[一周写个发明专利，先满足毕业要求！]]></title><link>https://blog.youkuaiyun.com/ccrr7/article/details/147458181</link><guid>https://blog.youkuaiyun.com/ccrr7/article/details/147458181</guid><author>ccrr7</author><pubDate>Wed, 23 Apr 2025 17:17:29 +0800</pubDate><description><![CDATA[专利撰写方法，专利指导]]></description><category></category></item><item><title><![CDATA[C++数据结构10：哈希表]]></title><link>https://blog.youkuaiyun.com/ccrr7/article/details/147456497</link><guid>https://blog.youkuaiyun.com/ccrr7/article/details/147456497</guid><author>ccrr7</author><pubDate>Wed, 23 Apr 2025 16:36:48 +0800</pubDate><description><![CDATA[哈希表，哈希函数，单链表]]></description><category></category></item><item><title><![CDATA[C++数据结构9：堆]]></title><link>https://blog.youkuaiyun.com/ccrr7/article/details/147428455</link><guid>https://blog.youkuaiyun.com/ccrr7/article/details/147428455</guid><author>ccrr7</author><pubDate>Tue, 22 Apr 2025 19:14:40 +0800</pubDate><description><![CDATA[小根堆，排序]]></description><category></category></item><item><title><![CDATA[C++数据结构8：并查集]]></title><link>https://blog.youkuaiyun.com/ccrr7/article/details/147426729</link><guid>https://blog.youkuaiyun.com/ccrr7/article/details/147426729</guid><author>ccrr7</author><pubDate>Tue, 22 Apr 2025 17:33:31 +0800</pubDate><description><![CDATA[不交集的并查集]]></description><category></category></item><item><title><![CDATA[C++数据结构7：KMP处理字符串]]></title><link>https://blog.youkuaiyun.com/ccrr7/article/details/147325317</link><guid>https://blog.youkuaiyun.com/ccrr7/article/details/147325317</guid><author>ccrr7</author><pubDate>Fri, 18 Apr 2025 12:34:49 +0800</pubDate><description><![CDATA[KMP算法，字符串匹配]]></description><category></category></item><item><title><![CDATA[C++数据结构6：滑动窗口]]></title><link>https://blog.youkuaiyun.com/ccrr7/article/details/147308093</link><guid>https://blog.youkuaiyun.com/ccrr7/article/details/147308093</guid><author>ccrr7</author><pubDate>Thu, 17 Apr 2025 16:24:18 +0800</pubDate><description><![CDATA[双端队列、滑动窗口]]></description><category></category></item><item><title><![CDATA[C++数据结构5：单调栈]]></title><link>https://blog.youkuaiyun.com/ccrr7/article/details/147295452</link><guid>https://blog.youkuaiyun.com/ccrr7/article/details/147295452</guid><author>ccrr7</author><pubDate>Thu, 17 Apr 2025 10:37:06 +0800</pubDate><description><![CDATA[单调递增栈]]></description><category></category></item><item><title><![CDATA[C++数据结构4：队列]]></title><link>https://blog.youkuaiyun.com/ccrr7/article/details/147292918</link><guid>https://blog.youkuaiyun.com/ccrr7/article/details/147292918</guid><author>ccrr7</author><pubDate>Thu, 17 Apr 2025 09:17:39 +0800</pubDate><description><![CDATA[数组模拟队列]]></description><category></category></item><item><title><![CDATA[C++数据结构3：栈]]></title><link>https://blog.youkuaiyun.com/ccrr7/article/details/147279340</link><guid>https://blog.youkuaiyun.com/ccrr7/article/details/147279340</guid><author>ccrr7</author><pubDate>Wed, 16 Apr 2025 16:21:39 +0800</pubDate><description><![CDATA[数组模拟栈，LIFO]]></description><category></category></item><item><title><![CDATA[C++数据结构2：双链表]]></title><link>https://blog.youkuaiyun.com/ccrr7/article/details/147273486</link><guid>https://blog.youkuaiyun.com/ccrr7/article/details/147273486</guid><author>ccrr7</author><pubDate>Wed, 16 Apr 2025 12:09:44 +0800</pubDate><description><![CDATA[数组模拟双链表，数据维护]]></description><category></category></item><item><title><![CDATA[C++数据结构1：单链表]]></title><link>https://blog.youkuaiyun.com/ccrr7/article/details/147252825</link><guid>https://blog.youkuaiyun.com/ccrr7/article/details/147252825</guid><author>ccrr7</author><pubDate>Tue, 15 Apr 2025 16:40:22 +0800</pubDate><description><![CDATA[数组模拟单链表]]></description><category></category></item></channel></rss>