<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[emmm_Yeah的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/emmm_Yeah</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; emmm_Yeah]]></copyright><item><title><![CDATA[3.6-3.10 OJ练习 数学 字符串]]></title><link>https://blog.youkuaiyun.com/emmm_Yeah/article/details/146062673</link><guid>https://blog.youkuaiyun.com/emmm_Yeah/article/details/146062673</guid><author>emmm_Yeah</author><pubDate>Thu, 20 Mar 2025 14:27:14 +0800</pubDate><description><![CDATA[OJ代码复建保存]]></description><category></category></item><item><title><![CDATA[3.1 字符串中等 22 递归【学习】]]></title><link>https://blog.youkuaiyun.com/emmm_Yeah/article/details/145951970</link><guid>https://blog.youkuaiyun.com/emmm_Yeah/article/details/145951970</guid><author>emmm_Yeah</author><pubDate>Sat, 01 Mar 2025 22:00:15 +0800</pubDate><description><![CDATA[string咋这么难上手呢 22直到要用递归但不太会用 直接Chat一下【积累】！！]]></description><category></category></item><item><title><![CDATA[2.28 链表、字符串中等 328 3]]></title><link>https://blog.youkuaiyun.com/emmm_Yeah/article/details/145936028</link><guid>https://blog.youkuaiyun.com/emmm_Yeah/article/details/145936028</guid><author>emmm_Yeah</author><pubDate>Fri, 28 Feb 2025 23:16:47 +0800</pubDate><description><![CDATA[328 和前两天练习的List 思路差不多 不要把指针看作结点 而是一条额外的链表 想要节点先断其尾
3 String unordered_Set用于查找重复值 XX.find(ch) == XX.end()则没找到 消除XX.erase(ch) 清空XX.clear() 加入XX.insert(ch) ]]></description><category></category></item><item><title><![CDATA[2.27 链表中等 817]]></title><link>https://blog.youkuaiyun.com/emmm_Yeah/article/details/145899830</link><guid>https://blog.youkuaiyun.com/emmm_Yeah/article/details/145899830</guid><author>emmm_Yeah</author><pubDate>Thu, 27 Feb 2025 21:39:14 +0800</pubDate><description><![CDATA[817 vector转unordered_set使用.count函数查找值是否存在于数组中]]></description><category></category></item><item><title><![CDATA[2.26 链表中等 86 143 链表逆转 快慢指针找中点 交叉合并链表 148 147插入排序]]></title><link>https://blog.youkuaiyun.com/emmm_Yeah/article/details/145872821</link><guid>https://blog.youkuaiyun.com/emmm_Yeah/article/details/145872821</guid><author>emmm_Yeah</author><pubDate>Wed, 26 Feb 2025 23:20:16 +0800</pubDate><description><![CDATA[链表逆转 快慢指针找中点 交叉合并链表和147的思路差不多 指针从来不是结点，它就是一个链表
147 自己完全写的 有点理解了 unsorted->next = prev->next ——《痔疮揪出来搓成兔尾巴》]]></description><category></category></item><item><title><![CDATA[2.25 链表 2 新建链表 82]]></title><link>https://blog.youkuaiyun.com/emmm_Yeah/article/details/145852712</link><guid>https://blog.youkuaiyun.com/emmm_Yeah/article/details/145852712</guid><author>emmm_Yeah</author><pubDate>Tue, 25 Feb 2025 21:23:12 +0800</pubDate><description><![CDATA[又回来了 猛猛肝一个月！ 2 82 链表 哑节点dummy 创建 增加结点 返回链表]]></description><category></category></item><item><title><![CDATA[2022英一大作文]]></title><link>https://blog.youkuaiyun.com/emmm_Yeah/article/details/144458776</link><guid>https://blog.youkuaiyun.com/emmm_Yeah/article/details/144458776</guid><author>emmm_Yeah</author><pubDate>Fri, 13 Dec 2024 19:45:49 +0800</pubDate><description><![CDATA[【自用！！！】]]></description><category></category></item><item><title><![CDATA[【刷题】算法设计题+程序设计题【2】2019-2024]]></title><link>https://blog.youkuaiyun.com/emmm_Yeah/article/details/143925607</link><guid>https://blog.youkuaiyun.com/emmm_Yeah/article/details/143925607</guid><author>emmm_Yeah</author><pubDate>Wed, 20 Nov 2024 22:05:19 +0800</pubDate><description><![CDATA[最后30天冲冲冲！！！12月之前，刷完真题一轮！]]></description><category></category></item><item><title><![CDATA[【刷题】算法设计题+程序设计题【1】2013-2018]]></title><link>https://blog.youkuaiyun.com/emmm_Yeah/article/details/143502884</link><guid>https://blog.youkuaiyun.com/emmm_Yeah/article/details/143502884</guid><author>emmm_Yeah</author><pubDate>Tue, 05 Nov 2024 15:47:01 +0800</pubDate><description><![CDATA[【刷题】算法设计题【数据结构】 和 程序设计题 【leetcode 中等+】]]></description><category></category></item><item><title><![CDATA[程序设计 基础篇]]></title><link>https://blog.youkuaiyun.com/emmm_Yeah/article/details/142778405</link><guid>https://blog.youkuaiyun.com/emmm_Yeah/article/details/142778405</guid><author>emmm_Yeah</author><pubDate>Fri, 01 Nov 2024 11:59:51 +0800</pubDate><description><![CDATA[数据结构与程序设计中的程序设计，内容不多，主读代码练习 刷刷力扣中等题]]></description><category></category></item><item><title><![CDATA[数据结构 手写代码练习 | 二叉树 图 排序查找]]></title><link>https://blog.youkuaiyun.com/emmm_Yeah/article/details/143225307</link><guid>https://blog.youkuaiyun.com/emmm_Yeah/article/details/143225307</guid><author>emmm_Yeah</author><pubDate>Fri, 25 Oct 2024 11:23:57 +0800</pubDate><description><![CDATA[最后9天，消化所有笔记，冲冲冲！！！]]></description><category></category></item><item><title><![CDATA[10.1 10.3 图DFS 中等 207 Course Schedule 210 Course Schedule Ⅱ]]></title><link>https://blog.youkuaiyun.com/emmm_Yeah/article/details/142668113</link><guid>https://blog.youkuaiyun.com/emmm_Yeah/article/details/142668113</guid><author>emmm_Yeah</author><pubDate>Thu, 03 Oct 2024 10:03:50 +0800</pubDate><description><![CDATA[207 210 考察点：选择合适数据结构创建图；使用DFS判断图中是否有环；找简单路径]]></description><category></category></item><item><title><![CDATA[王道数据结构 | 第八章 排序]]></title><link>https://blog.youkuaiyun.com/emmm_Yeah/article/details/142519294</link><guid>https://blog.youkuaiyun.com/emmm_Yeah/article/details/142519294</guid><author>emmm_Yeah</author><pubDate>Fri, 27 Sep 2024 19:21:18 +0800</pubDate><description><![CDATA[王道数据结构 | 第八章 排序 DONE!]]></description><category></category></item><item><title><![CDATA[9.18 DFS 中等 130 Surrounded Regions 【搭配200食用更佳】]]></title><link>https://blog.youkuaiyun.com/emmm_Yeah/article/details/142334819</link><guid>https://blog.youkuaiyun.com/emmm_Yeah/article/details/142334819</guid><author>emmm_Yeah</author><pubDate>Wed, 18 Sep 2024 15:52:29 +0800</pubDate><description><![CDATA[130 被围绕的区域 与200不同的是，与边缘接壤的region不能被捕捉，不做变动，所以这里只要先将与边缘接壤的区域找出来，剩余再遇到的O区肯定不与边缘接壤，安心被X覆盖即可]]></description><category></category></item><item><title><![CDATA[9.17 DFS中等 200 Number of Islands]]></title><link>https://blog.youkuaiyun.com/emmm_Yeah/article/details/142317004</link><guid>https://blog.youkuaiyun.com/emmm_Yeah/article/details/142317004</guid><author>emmm_Yeah</author><pubDate>Tue, 17 Sep 2024 18:11:45 +0800</pubDate><description><![CDATA[200 岛屿数量 探索岛屿的领土 使用 DFS递归的思路：不需要确定具体方向，直接上下左右全面开花，如果不满足探索条件就直接暂停递归，如果满足探索条件就直接在新的数组中进行标记。所以探索条件是：在matrix范围内+不为海水‘0’+没有探索过island==0]]></description><category></category></item><item><title><![CDATA[9.15 BFS中等 133 Clone Graph review 138 随机链表的复制]]></title><link>https://blog.youkuaiyun.com/emmm_Yeah/article/details/142286239</link><guid>https://blog.youkuaiyun.com/emmm_Yeah/article/details/142286239</guid><author>emmm_Yeah</author><pubDate>Sun, 15 Sep 2024 17:58:28 +0800</pubDate><description><![CDATA[133 克隆图 138 随机链表的复制
注意复制的对象不仅仅是结点，还有其中边的关系，要保证克隆的边指向的不是原链表/图结点。【哈希表】]]></description><category></category></item><item><title><![CDATA[9.14 DFS 简单 111 Minimum Depth of Binary Tree 112 Path Sum]]></title><link>https://blog.youkuaiyun.com/emmm_Yeah/article/details/142263072</link><guid>https://blog.youkuaiyun.com/emmm_Yeah/article/details/142263072</guid><author>emmm_Yeah</author><pubDate>Sat, 14 Sep 2024 17:43:25 +0800</pubDate><description><![CDATA[111 DFS 不太熟练的用法 好法多磨
112 DFS 比较典型的例子]]></description><category></category></item><item><title><![CDATA[9.13 DFS&BFS 简单 101 Symmetric Tree 104 Maximum Depth of Binary Tree]]></title><link>https://blog.youkuaiyun.com/emmm_Yeah/article/details/142215468</link><guid>https://blog.youkuaiyun.com/emmm_Yeah/article/details/142215468</guid><author>emmm_Yeah</author><pubDate>Fri, 13 Sep 2024 17:10:57 +0800</pubDate><description><![CDATA[101 镜像树的判断 层次遍历
104 树的最大深度 DFS：比较左右子树的深度]]></description><category></category></item><item><title><![CDATA[王道数据结构 | 第七章 查找]]></title><link>https://blog.youkuaiyun.com/emmm_Yeah/article/details/142212905</link><guid>https://blog.youkuaiyun.com/emmm_Yeah/article/details/142212905</guid><author>emmm_Yeah</author><pubDate>Fri, 13 Sep 2024 16:44:30 +0800</pubDate><description><![CDATA[王道数据结构 | 第七章 查找【完结撒花🎉】]]></description><category></category></item><item><title><![CDATA[8.29 二叉树中等 113 Path Sum II 437 Path Sum III]]></title><link>https://blog.youkuaiyun.com/emmm_Yeah/article/details/141670650</link><guid>https://blog.youkuaiyun.com/emmm_Yeah/article/details/141670650</guid><author>emmm_Yeah</author><pubDate>Thu, 29 Aug 2024 09:58:26 +0800</pubDate><description><![CDATA[113 437 129 236 四道题可以合并起来练都是基于寻找【root-to-leaf】的路径做出的一些变形，主要解决思路是DFS 递归。写完递归再根据例子走一遍代码过程，以防一些小细节出问题。]]></description><category></category></item></channel></rss>