<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[ResNet156的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/ResNet156</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; ResNet156]]></copyright><item><title><![CDATA[CodeTop一刷]]></title><link>https://blog.youkuaiyun.com/ResNet156/article/details/147612351</link><guid>https://blog.youkuaiyun.com/ResNet156/article/details/147612351</guid><author>ResNet156</author><pubDate>Mon, 02 Jun 2025 14:31:48 +0800</pubDate><description><![CDATA[在这里插入代码片return res;return res;return mid;return -1;return mid;return -1;]]></description><category></category></item><item><title><![CDATA[代码随想录五刷day12]]></title><link>https://blog.youkuaiyun.com/ResNet156/article/details/146593744</link><guid>https://blog.youkuaiyun.com/ResNet156/article/details/146593744</guid><author>ResNet156</author><pubDate>Tue, 29 Apr 2025 15:03:53 +0800</pubDate><description><![CDATA[i <= m;i <= n;邻接表i <= n;;]]></description><category></category></item><item><title><![CDATA[代码随想录五刷day11]]></title><link>https://blog.youkuaiyun.com/ResNet156/article/details/146512932</link><guid>https://blog.youkuaiyun.com/ResNet156/article/details/146512932</guid><author>ResNet156</author><pubDate>Fri, 28 Mar 2025 12:31:22 +0800</pubDate><description><![CDATA[单调栈]]></description><category></category></item><item><title><![CDATA[代码随想录五刷day10]]></title><link>https://blog.youkuaiyun.com/ResNet156/article/details/146370820</link><guid>https://blog.youkuaiyun.com/ResNet156/article/details/146370820</guid><author>ResNet156</author><pubDate>Tue, 25 Mar 2025 21:09:17 +0800</pubDate><description><![CDATA[动态规划]]></description><category></category></item><item><title><![CDATA[代码随想录五刷day9]]></title><link>https://blog.youkuaiyun.com/ResNet156/article/details/146317097</link><guid>https://blog.youkuaiyun.com/ResNet156/article/details/146317097</guid><author>ResNet156</author><pubDate>Wed, 19 Mar 2025 14:45:14 +0800</pubDate><description><![CDATA[贪心算法]]></description><category></category></item><item><title><![CDATA[代码随想录五刷day8]]></title><link>https://blog.youkuaiyun.com/ResNet156/article/details/145630817</link><guid>https://blog.youkuaiyun.com/ResNet156/article/details/145630817</guid><author>ResNet156</author><pubDate>Mon, 17 Mar 2025 15:54:10 +0800</pubDate><description><![CDATA[回溯]]></description><category></category></item><item><title><![CDATA[代码随想录五刷day7]]></title><link>https://blog.youkuaiyun.com/ResNet156/article/details/144778098</link><guid>https://blog.youkuaiyun.com/ResNet156/article/details/144778098</guid><author>ResNet156</author><pubDate>Fri, 14 Feb 2025 12:45:22 +0800</pubDate><description><![CDATA[二叉树]]></description><category></category></item><item><title><![CDATA[代码随想录五刷day6]]></title><link>https://blog.youkuaiyun.com/ResNet156/article/details/144571165</link><guid>https://blog.youkuaiyun.com/ResNet156/article/details/144571165</guid><author>ResNet156</author><pubDate>Fri, 27 Dec 2024 21:47:13 +0800</pubDate><description><![CDATA[二叉树的层序遍历，就是图论中的广度优先搜索在二叉树中的应用，需要借助队列来实现（此时又发现队列的一个应用了）。]]></description><category></category></item><item><title><![CDATA[代码随想录五刷day5]]></title><link>https://blog.youkuaiyun.com/ResNet156/article/details/144115760</link><guid>https://blog.youkuaiyun.com/ResNet156/article/details/144115760</guid><author>ResNet156</author><pubDate>Wed, 18 Dec 2024 22:28:13 +0800</pubDate><description><![CDATA[在栈与队列系列中，我们强调栈与队列的基础，也是很多同学容易忽视的点。

使用抽象程度越高的语言，越容易忽视其底层实现，而C++相对来说是比较接近底层的语言。

我们用栈实现队列，用队列实现栈来掌握的栈与队列的基本操作。]]></description><category></category></item><item><title><![CDATA[代码随想录五刷day4]]></title><link>https://blog.youkuaiyun.com/ResNet156/article/details/143755283</link><guid>https://blog.youkuaiyun.com/ResNet156/article/details/143755283</guid><author>ResNet156</author><pubDate>Thu, 28 Nov 2024 16:58:09 +0800</pubDate><description><![CDATA[字符串类类型的题目，往往想法比较简单，但是实现起来并不容易，复杂的字符串题目非常考验对代码的掌控能力。

双指针法是字符串处理的常客。

KMP算法是字符串查找最重要的算法，但彻底理解KMP并不容易，我们已经写了五篇KMP的文章，不断总结和完善，最终才把KMP讲清楚。

好了字符串相关的算法知识就介绍到了这里了，明天开始新的征程，大家加油！]]></description><category></category></item><item><title><![CDATA[代码随想录五刷day3]]></title><link>https://blog.youkuaiyun.com/ResNet156/article/details/143725567</link><guid>https://blog.youkuaiyun.com/ResNet156/article/details/143725567</guid><author>ResNet156</author><pubDate>Wed, 13 Nov 2024 23:57:37 +0800</pubDate><description><![CDATA[一般来说哈希表都是用来快速判断一个元素是否出现集合里。]]></description><category></category></item><item><title><![CDATA[代码随想录五刷day2]]></title><link>https://blog.youkuaiyun.com/ResNet156/article/details/143666214</link><guid>https://blog.youkuaiyun.com/ResNet156/article/details/143666214</guid><author>ResNet156</author><pubDate>Tue, 12 Nov 2024 22:16:57 +0800</pubDate><description><![CDATA[链表的经典操作有，1、虚拟头结点，2、双指针不同时起步，3、快慢指针]]></description><category></category></item><item><title><![CDATA[代码随想录五刷day1]]></title><link>https://blog.youkuaiyun.com/ResNet156/article/details/143571497</link><guid>https://blog.youkuaiyun.com/ResNet156/article/details/143571497</guid><author>ResNet156</author><pubDate>Sun, 10 Nov 2024 20:32:37 +0800</pubDate><description><![CDATA[数组中的五个常用方法：二分法、双指针法、滑动窗口、模拟行为、前缀和]]></description><category></category></item><item><title><![CDATA[代码随想录四刷day16]]></title><link>https://blog.youkuaiyun.com/ResNet156/article/details/141682572</link><guid>https://blog.youkuaiyun.com/ResNet156/article/details/141682572</guid><author>ResNet156</author><pubDate>Thu, 29 Aug 2024 20:57:10 +0800</pubDate><description><![CDATA[本周的主题其实是简单但并不简单，本周所选的题目大多是看一下就会的题目，但是大家看完本周的文章估计也发现了，二叉树的简单题目其实里面都藏了很多细节。 这些细节我都给大家展现了出来。]]></description><category></category></item><item><title><![CDATA[代码随想录四刷day15]]></title><link>https://blog.youkuaiyun.com/ResNet156/article/details/141636403</link><guid>https://blog.youkuaiyun.com/ResNet156/article/details/141636403</guid><author>ResNet156</author><pubDate>Wed, 28 Aug 2024 12:16:03 +0800</pubDate><description><![CDATA[最小深度是从根节点到最近叶子节点的最短路径上的节点数量。]]></description><category></category></item><item><title><![CDATA[代码随想录四刷day14]]></title><link>https://blog.youkuaiyun.com/ResNet156/article/details/141602686</link><guid>https://blog.youkuaiyun.com/ResNet156/article/details/141602686</guid><author>ResNet156</author><pubDate>Wed, 28 Aug 2024 11:20:54 +0800</pubDate><description><![CDATA[迭代法中我们使用了队列，需要注意的是这不是层序遍历，而且仅仅通过一个容器来成对的存放我们要比较的元素，知道这一本质之后就发现，用队列，用栈，甚至用数组，都是可以的。]]></description><category></category></item><item><title><![CDATA[代码随想录四刷day13]]></title><link>https://blog.youkuaiyun.com/ResNet156/article/details/141559204</link><guid>https://blog.youkuaiyun.com/ResNet156/article/details/141559204</guid><author>ResNet156</author><pubDate>Mon, 26 Aug 2024 17:28:14 +0800</pubDate><description><![CDATA[学会二叉树的层序遍历，可以一口气打完以下十题]]></description><category></category></item><item><title><![CDATA[代码随想录四刷day12]]></title><link>https://blog.youkuaiyun.com/ResNet156/article/details/141429976</link><guid>https://blog.youkuaiyun.com/ResNet156/article/details/141429976</guid><author>ResNet156</author><pubDate>Mon, 26 Aug 2024 11:02:21 +0800</pubDate><description><![CDATA[可能有同学感觉前后中序遍历的递归太简单了，要打迭代法（非递归），别急，我们明天打迭代法，打个通透]]></description><category></category></item><item><title><![CDATA[代码随想录四刷day11]]></title><link>https://blog.youkuaiyun.com/ResNet156/article/details/141301945</link><guid>https://blog.youkuaiyun.com/ResNet156/article/details/141301945</guid><author>ResNet156</author><pubDate>Mon, 19 Aug 2024 17:48:50 +0800</pubDate><description><![CDATA[class MyQueue {
    Deque deque = new LinkedList();
    //弹出元素时，比较当前要弹出的数值是否等于队列出口的数值，如果相等则弹出
    //同时判断队列当前是否为空
    void poll(int val) {
        if (!deque.isEmpty() && val == deque.peek()) {
            deque.poll();
        }
    }
    //添加元素]]></description><category></category></item><item><title><![CDATA[代码随想录四刷day10]]></title><link>https://blog.youkuaiyun.com/ResNet156/article/details/141268129</link><guid>https://blog.youkuaiyun.com/ResNet156/article/details/141268129</guid><author>ResNet156</author><pubDate>Sun, 18 Aug 2024 16:17:41 +0800</pubDate><description><![CDATA[其实很多算法题目主要是对知识点的考察和教学意义远大于其工程实践的意义，所以面试题也是这样]]></description><category></category></item></channel></rss>