<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[Antigonos的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/Antigonos</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; Antigonos]]></copyright><item><title><![CDATA[手撕C语言题典——相交链表]]></title><link>https://blog.youkuaiyun.com/Antigonos/article/details/139397209</link><guid>https://blog.youkuaiyun.com/Antigonos/article/details/139397209</guid><author>Antigonos</author><pubDate>Tue, 04 Jun 2024 19:48:31 +0800</pubDate><description><![CDATA[依旧是力扣上的一道题，有许多新思路提供给我们]]></description><category></category></item><item><title><![CDATA[手撕C语言题典——返回倒数第 k 个节点（面试题）]]></title><link>https://blog.youkuaiyun.com/Antigonos/article/details/139277064</link><guid>https://blog.youkuaiyun.com/Antigonos/article/details/139277064</guid><author>Antigonos</author><pubDate>Tue, 28 May 2024 20:33:19 +0800</pubDate><description><![CDATA[依旧力扣，这道题之前有做过类似的题，今天给一个新的思路去做，]]></description><category></category></item><item><title><![CDATA[手撕C语言题典——消失的数字]]></title><link>https://blog.youkuaiyun.com/Antigonos/article/details/139217162</link><guid>https://blog.youkuaiyun.com/Antigonos/article/details/139217162</guid><author>Antigonos</author><pubDate>Sun, 26 May 2024 17:30:50 +0800</pubDate><description><![CDATA[依旧是一道力扣上的题，通过不同思路的不同时间复杂度来分析，让我们看看有什么不同。]]></description><category></category></item><item><title><![CDATA[手撕C语言题典——轮转数组]]></title><link>https://blog.youkuaiyun.com/Antigonos/article/details/139156971</link><guid>https://blog.youkuaiyun.com/Antigonos/article/details/139156971</guid><author>Antigonos</author><pubDate>Thu, 23 May 2024 20:49:26 +0800</pubDate><description><![CDATA[学习C++之前我们需要搞懂时间复杂度，这个蛮重要的，我们将通过几个题来了解什么是时间复杂度]]></description><category></category></item><item><title><![CDATA[手撕C语言题典——分割链表（面试题）]]></title><link>https://blog.youkuaiyun.com/Antigonos/article/details/138960832</link><guid>https://blog.youkuaiyun.com/Antigonos/article/details/138960832</guid><author>Antigonos</author><pubDate>Thu, 16 May 2024 15:49:32 +0800</pubDate><description><![CDATA[在我们学习了那么多经典题目之后我们来看一道来自力扣上的有关链表的面试题来给脑子上上强度 ~]]></description><category></category></item><item><title><![CDATA[手撕C语言题典——环形链表的约瑟夫问题]]></title><link>https://blog.youkuaiyun.com/Antigonos/article/details/138859869</link><guid>https://blog.youkuaiyun.com/Antigonos/article/details/138859869</guid><author>Antigonos</author><pubDate>Tue, 14 May 2024 17:38:23 +0800</pubDate><description><![CDATA[Josephus 问题是一个古老而著名的问题，最早的记载来自犹太历史学家弗拉维奥·约瑟夫斯（FlaviusJosephus）]]></description><category></category></item><item><title><![CDATA[手撕C语言题典——链表的中间节点]]></title><link>https://blog.youkuaiyun.com/Antigonos/article/details/138835624</link><guid>https://blog.youkuaiyun.com/Antigonos/article/details/138835624</guid><author>Antigonos</author><pubDate>Tue, 14 May 2024 09:01:48 +0800</pubDate><description><![CDATA[链表的中间节点同样也是力扣上一道简单题，适合刚学过单链表的我们更好的理解链表相关知识~]]></description><category></category></item><item><title><![CDATA[手撕C语言题典——反转链表]]></title><link>https://blog.youkuaiyun.com/Antigonos/article/details/138764808</link><guid>https://blog.youkuaiyun.com/Antigonos/article/details/138764808</guid><author>Antigonos</author><pubDate>Sun, 12 May 2024 20:35:17 +0800</pubDate><description><![CDATA[反转链表同样也是力扣上一道简单题，适合刚学过单链表的我们更好的理解链表相关知识~]]></description><category></category></item><item><title><![CDATA[手撕C语言题典——移除链表元素（单链表）]]></title><link>https://blog.youkuaiyun.com/Antigonos/article/details/138647423</link><guid>https://blog.youkuaiyun.com/Antigonos/article/details/138647423</guid><author>Antigonos</author><pubDate>Fri, 10 May 2024 20:20:36 +0800</pubDate><description><![CDATA[移除链表元素是力扣上一道简单题，适合刚学过单链表的我们更好的理解链表相关知识~]]></description><category></category></item><item><title><![CDATA[数据结构之单链表的基本操作]]></title><link>https://blog.youkuaiyun.com/Antigonos/article/details/138620147</link><guid>https://blog.youkuaiyun.com/Antigonos/article/details/138620147</guid><author>Antigonos</author><pubDate>Thu, 09 May 2024 17:07:44 +0800</pubDate><description><![CDATA[单~链~表~~]]></description><category></category></item><item><title><![CDATA[数据结构之单单单——链表]]></title><link>https://blog.youkuaiyun.com/Antigonos/article/details/138572782</link><guid>https://blog.youkuaiyun.com/Antigonos/article/details/138572782</guid><author>Antigonos</author><pubDate>Wed, 08 May 2024 16:30:41 +0800</pubDate><description><![CDATA[链表（Linked List）是一种物理存储结构上非连续，非顺序的储存结构，数据元素的逻辑顺序是通过链表中指针链接次序实现的。]]></description><category></category></item><item><title><![CDATA[手撕C语言题典——合并两个有序数组（顺序表）]]></title><link>https://blog.youkuaiyun.com/Antigonos/article/details/138376203</link><guid>https://blog.youkuaiyun.com/Antigonos/article/details/138376203</guid><author>Antigonos</author><pubDate>Wed, 01 May 2024 18:39:49 +0800</pubDate><description><![CDATA[合并数组也是力扣上关于顺序表的一道简单题，继续来加深一下对顺序表的理解，当然大家也可以先去力扣上自己 try 一下~]]></description><category></category></item><item><title><![CDATA[手撕C语言题典——移除元素（顺序表）]]></title><link>https://blog.youkuaiyun.com/Antigonos/article/details/138312861</link><guid>https://blog.youkuaiyun.com/Antigonos/article/details/138312861</guid><author>Antigonos</author><pubDate>Mon, 29 Apr 2024 15:46:34 +0800</pubDate><description><![CDATA[27. 移除元素 - 力扣（LeetCode）移除元素作为力扣上的一道不算太难的算法题，很适合刚学过顺序表的我们拿来练手，大家也可以去力扣上自己 try 一下~]]></description><category></category></item><item><title><![CDATA[数据结构之顺序表的基本操作]]></title><link>https://blog.youkuaiyun.com/Antigonos/article/details/138289857</link><guid>https://blog.youkuaiyun.com/Antigonos/article/details/138289857</guid><author>Antigonos</author><pubDate>Sun, 28 Apr 2024 20:39:01 +0800</pubDate><description><![CDATA[顺~序~表~~~]]></description><category></category></item><item><title><![CDATA[数据结构之顺顺顺——顺序表]]></title><link>https://blog.youkuaiyun.com/Antigonos/article/details/138288547</link><guid>https://blog.youkuaiyun.com/Antigonos/article/details/138288547</guid><author>Antigonos</author><pubDate>Sun, 28 Apr 2024 20:04:58 +0800</pubDate><description><![CDATA[顺~序~表~]]></description><category></category></item><item><title><![CDATA[手撕C语言题典——逆序输出]]></title><link>https://blog.youkuaiyun.com/Antigonos/article/details/136889662</link><guid>https://blog.youkuaiyun.com/Antigonos/article/details/136889662</guid><author>Antigonos</author><pubDate>Wed, 20 Mar 2024 22:38:13 +0800</pubDate><description><![CDATA[数组是不能够进行赋值操作，假如我们上面的程序声明的是“ int a[maxn],b[maxn]”,是不能赋值 b=a 的。我们来一段一段拆解这个程序，“int a[maxn]”声明了一个包含了 maxn 个整型变量的数组，分别有 a[0],a[1],a[2]······a[maxn-1]。存好以后就可以倒着输出了 a[n-1],a[n-2]······a[0]。循环结束后，数据被储存在 a[0],a[1],a[2]······a[n-1] 中，n为整数的个数。Ps：1.maxn必须是常数，不能是变量。]]></description><category></category></item><item><title><![CDATA[手撕JVAV题典——罗马数字逆向解法（暴力求解）]]></title><link>https://blog.youkuaiyun.com/Antigonos/article/details/136813569</link><guid>https://blog.youkuaiyun.com/Antigonos/article/details/136813569</guid><author>Antigonos</author><pubDate>Mon, 18 Mar 2024 18:12:38 +0800</pubDate><description><![CDATA[作为一道经典老题，罗马数字转整数无疑是算法竞赛中简单且经典的题目，也是暴力求解极具代表性的题目之一]]></description><category></category></item><item><title><![CDATA[手撕C语言题典——打印菱形]]></title><link>https://blog.youkuaiyun.com/Antigonos/article/details/136193095</link><guid>https://blog.youkuaiyun.com/Antigonos/article/details/136193095</guid><author>Antigonos</author><pubDate>Thu, 14 Mar 2024 19:52:15 +0800</pubDate><description><![CDATA[作为C语言经典类型题，打印菱形是不少初学者很头疼的问题，但这题的本质其实就是找规律，结合图像会更容易理解。]]></description><category></category></item><item><title><![CDATA[梦回1992——扫雷（C语言简易版）]]></title><link>https://blog.youkuaiyun.com/Antigonos/article/details/136043066</link><guid>https://blog.youkuaiyun.com/Antigonos/article/details/136043066</guid><author>Antigonos</author><pubDate>Mon, 05 Feb 2024 19:21:42 +0800</pubDate><description><![CDATA[扫雷这个基于数字的逻辑谜题最早来自20世纪六七十年代，当时Jerimac Ratliff推出的名为“Cube”的游戏已经非常受人欢迎。]]></description><category></category></item><item><title><![CDATA[C语言二分查找练习]]></title><link>https://blog.youkuaiyun.com/Antigonos/article/details/135982184</link><guid>https://blog.youkuaiyun.com/Antigonos/article/details/135982184</guid><author>Antigonos</author><pubDate>Thu, 01 Feb 2024 21:20:14 +0800</pubDate><description><![CDATA[在⼀个升序的数组中查找指定的数字n，很容易想到的⽅法就是遍历数组，但是这种方法效率比较感人。比如我买了⼀双鞋，你好奇问我多少钱，我说不超过300元。你还是好奇，你想知道到底多少，我就让你猜，你会怎么猜？你会1，2，3，4...这样猜吗？一般你都会猜中间数字，比如：150，然后看大了还是小了，这就是二分查找，也叫折半查找。，如果left和right比较大的时候可能存在问。今天就到这里了0.0 bye~求中间元素的下标，使用。]]></description><category></category></item></channel></rss>