<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[suibiansa_的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/suibiansa_</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; suibiansa_]]></copyright><item><title><![CDATA[力扣142题——环形链表II]]></title><link>https://blog.youkuaiyun.com/suibiansa_/article/details/145641923</link><guid>https://blog.youkuaiyun.com/suibiansa_/article/details/145641923</guid><author>suibiansa_</author><pubDate>Fri, 14 Feb 2025 21:34:46 +0800</pubDate><description><![CDATA[这道链表题还是需要一些思维，这里把代码随想录的链接也贴在这里，有需要的小伙伴自行点击：https://programmercarl.com/0142.%E7%8E%AF%E5%BD%A2%E9%93%BE%E8%A1%A8II.html#%E7%AE%97%E6%B3%95%E5%85%AC%E5%BC%80%E8%AF%BE]]></description><category></category></item><item><title><![CDATA[力扣19题——删除链表的倒数第 N 个结点]]></title><link>https://blog.youkuaiyun.com/suibiansa_/article/details/145619682</link><guid>https://blog.youkuaiyun.com/suibiansa_/article/details/145619682</guid><author>suibiansa_</author><pubDate>Thu, 13 Feb 2025 20:18:13 +0800</pubDate><description><![CDATA[【代码】力扣19题——删除链表的倒数第 N 个结点。]]></description><category></category></item><item><title><![CDATA[力扣24题——两两交换链表中节点]]></title><link>https://blog.youkuaiyun.com/suibiansa_/article/details/145602110</link><guid>https://blog.youkuaiyun.com/suibiansa_/article/details/145602110</guid><author>suibiansa_</author><pubDate>Wed, 12 Feb 2025 23:50:18 +0800</pubDate><description><![CDATA[【代码】力扣24题——两两交换链表中节点。]]></description><category></category></item><item><title><![CDATA[力扣206题——反转链表]]></title><link>https://blog.youkuaiyun.com/suibiansa_/article/details/145343868</link><guid>https://blog.youkuaiyun.com/suibiansa_/article/details/145343868</guid><author>suibiansa_</author><pubDate>Fri, 24 Jan 2025 17:04:46 +0800</pubDate><description><![CDATA[反转链表也是谜？]]></description><category></category></item><item><title><![CDATA[设计链表总结]]></title><link>https://blog.youkuaiyun.com/suibiansa_/article/details/145342296</link><guid>https://blog.youkuaiyun.com/suibiansa_/article/details/145342296</guid><author>suibiansa_</author><pubDate>Fri, 24 Jan 2025 15:59:40 +0800</pubDate><description><![CDATA[这就可以解释我们下面编写的代码。]]></description><category></category></item><item><title><![CDATA[力扣707题（2）——设计链表]]></title><link>https://blog.youkuaiyun.com/suibiansa_/article/details/145329672</link><guid>https://blog.youkuaiyun.com/suibiansa_/article/details/145329672</guid><author>suibiansa_</author><pubDate>Thu, 23 Jan 2025 23:12:43 +0800</pubDate><description><![CDATA[删除和指定插入方法类似。]]></description><category></category></item><item><title><![CDATA[力扣707题——设计链表]]></title><link>https://blog.youkuaiyun.com/suibiansa_/article/details/145292015</link><guid>https://blog.youkuaiyun.com/suibiansa_/article/details/145292015</guid><author>suibiansa_</author><pubDate>Tue, 21 Jan 2025 22:54:38 +0800</pubDate><description><![CDATA[从零开始设计链表，我们拆分成两次任务，今天先看。]]></description><category></category></item><item><title><![CDATA[力扣203题（3）]]></title><link>https://blog.youkuaiyun.com/suibiansa_/article/details/145269195</link><guid>https://blog.youkuaiyun.com/suibiansa_/article/details/145269195</guid><author>suibiansa_</author><pubDate>Mon, 20 Jan 2025 21:05:06 +0800</pubDate><description><![CDATA[虚拟创建头节点删除链表]]></description><category></category></item><item><title><![CDATA[力扣203题（2）——移除链表元素]]></title><link>https://blog.youkuaiyun.com/suibiansa_/article/details/145242573</link><guid>https://blog.youkuaiyun.com/suibiansa_/article/details/145242573</guid><author>suibiansa_</author><pubDate>Sun, 19 Jan 2025 14:32:09 +0800</pubDate><description><![CDATA[题目及递归法在我的这一篇博客，各位小伙伴可以移步这里q查看：共勉！]]></description><category></category></item><item><title><![CDATA[力扣203题—— 移除链表元素]]></title><link>https://blog.youkuaiyun.com/suibiansa_/article/details/145242479</link><guid>https://blog.youkuaiyun.com/suibiansa_/article/details/145242479</guid><author>suibiansa_</author><pubDate>Sun, 19 Jan 2025 14:19:55 +0800</pubDate><description><![CDATA[题目说的头结点一点也不严谨，讲道理应该是首元结点才对，在数据结构中把头结点定义为有头结点的第一个结点，这里题目要给大差评！]]></description><category></category></item><item><title><![CDATA[链表的学习]]></title><link>https://blog.youkuaiyun.com/suibiansa_/article/details/145228070</link><guid>https://blog.youkuaiyun.com/suibiansa_/article/details/145228070</guid><author>suibiansa_</author><pubDate>Sat, 18 Jan 2025 15:26:54 +0800</pubDate><description><![CDATA[链表有数据域和指针域，随机分配在内存空间中，通过指针去找后继元素或者前驱元素，链表便于进行元素的修改和删除，较少进行查找；而数组是在内存中开辟出来的一块连续区域，这一块区域都属于数组，更便于查找而更少进行修改和删除。]]></description><category></category></item><item><title><![CDATA[58.区间和——代码随想录]]></title><link>https://blog.youkuaiyun.com/suibiansa_/article/details/145208824</link><guid>https://blog.youkuaiyun.com/suibiansa_/article/details/145208824</guid><author>suibiansa_</author><pubDate>Fri, 17 Jan 2025 15:54:40 +0800</pubDate><description><![CDATA[这个题目是代码随想录的题目，用来开拓我们的思维给定一个整数数组 Array，请计算该数组在每个指定区间内元素的总和。第一行输入为整数数组 Array 的长度 n，接下来 n 行，每行一个整数，表示数组的元素。随后的输入为需要计算总和的区间下标：a，b （b > = a），直至文件结束。输出每个指定区间内元素的总和。39。]]></description><category></category></item><item><title><![CDATA[力扣54题——螺旋矩阵]]></title><link>https://blog.youkuaiyun.com/suibiansa_/article/details/145191184</link><guid>https://blog.youkuaiyun.com/suibiansa_/article/details/145191184</guid><author>suibiansa_</author><pubDate>Thu, 16 Jan 2025 20:49:35 +0800</pubDate><description><![CDATA[给你一个m行n列的矩阵matrix，请按照，返回矩阵中的所有元素。]]></description><category></category></item><item><title><![CDATA[力扣209题——长度最小子数组]]></title><link>https://blog.youkuaiyun.com/suibiansa_/article/details/145157953</link><guid>https://blog.youkuaiyun.com/suibiansa_/article/details/145157953</guid><author>suibiansa_</author><pubDate>Wed, 15 Jan 2025 12:43:26 +0800</pubDate><description><![CDATA[暴力法解数组]]></description><category></category></item><item><title><![CDATA[力扣59题——螺旋矩阵II]]></title><link>https://blog.youkuaiyun.com/suibiansa_/article/details/145157858</link><guid>https://blog.youkuaiyun.com/suibiansa_/article/details/145157858</guid><author>suibiansa_</author><pubDate>Wed, 15 Jan 2025 12:38:29 +0800</pubDate><description><![CDATA[一杯茶，一包烟，一道螺旋解一天——代码人]]></description><category></category></item><item><title><![CDATA[力扣209(2)——滑动窗口？！快慢指针的pro版罢了]]></title><link>https://blog.youkuaiyun.com/suibiansa_/article/details/145142031</link><guid>https://blog.youkuaiyun.com/suibiansa_/article/details/145142031</guid><author>suibiansa_</author><pubDate>Tue, 14 Jan 2025 16:34:59 +0800</pubDate><description><![CDATA[滑动窗口？！快慢指针的pro版罢了]]></description><category></category></item><item><title><![CDATA[力扣977（2）]]></title><link>https://blog.youkuaiyun.com/suibiansa_/article/details/145121507</link><guid>https://blog.youkuaiyun.com/suibiansa_/article/details/145121507</guid><author>suibiansa_</author><pubDate>Mon, 13 Jan 2025 18:59:03 +0800</pubDate><description><![CDATA[而l <= r呢，就是说两指针相等时也可以说相遇时我们就完成了数组的一次遍历，在遍历时我们要比较两个指针所指向数平方的大小，取出较大值放入我们定义的新数组a中，并让k指针再退一个。（这里数组可以随便起名字，可以叫a也可以起别的；同样指针k也是只要不和java关键字相同）因为题目说按非递减顺序排嘛，如果按照非递增来排，就把k定义到新数组开头，再让k增一个。那么如此比较，我们最后就能得到一个按照非递减顺讯排列的平方数组a，最后返回a就可以了。用一个指针指向题目数组的开头，另一个指向数组的末尾，这里分别用。]]></description><category></category></item><item><title><![CDATA[力扣977题——有序数组的平方]]></title><link>https://blog.youkuaiyun.com/suibiansa_/article/details/145089319</link><guid>https://blog.youkuaiyun.com/suibiansa_/article/details/145089319</guid><author>suibiansa_</author><pubDate>Sun, 12 Jan 2025 10:46:47 +0800</pubDate><description><![CDATA[【代码】力扣977题——有序数组的平方。]]></description><category></category></item><item><title><![CDATA[力扣844题——比较含退格的字符串]]></title><link>https://blog.youkuaiyun.com/suibiansa_/article/details/145079734</link><guid>https://blog.youkuaiyun.com/suibiansa_/article/details/145079734</guid><author>suibiansa_</author><pubDate>Sat, 11 Jan 2025 17:22:18 +0800</pubDate><description><![CDATA[这题比普通数组略难一些，题目给到我们的是两个字符串，所以关于字符串的一些操作还是借鉴了一下大佬的，其他就和快慢指针法没有太多的差别。这也算是我现在还没有攻克的一点知识吧，加油共勉！]]></description><category></category></item><item><title><![CDATA[力扣283题——移除0]]></title><link>https://blog.youkuaiyun.com/suibiansa_/article/details/145064069</link><guid>https://blog.youkuaiyun.com/suibiansa_/article/details/145064069</guid><author>suibiansa_</author><pubDate>Fri, 10 Jan 2025 19:25:41 +0800</pubDate><description><![CDATA[【代码】力扣283题——移除0。]]></description><category></category></item></channel></rss>