<![CDATA[Raymond_yang1102的博客]]>https://blog.youkuaiyun.com/Raymond_yang1102zh-cnhttps://blog.youkuaiyun.com/<![CDATA[LRU 缓存：为什么教科书答案在工业界全被改写？——哈希表 + 双向链表、Redis 近似 LRU 与 InnoDB 两段式 LRU 的工程级解析]]>https://blog.youkuaiyun.com/Raymond_yang1102/article/details/166370475https://blog.youkuaiyun.com/Raymond_yang1102/article/details/166370475Raymond_yang1102Tue, 22 Sep 2026 18:47:33 +0800<![CDATA[柱状图中最大的矩形：单调栈为什么被称为“一题通八题“？——从左右边界到哨兵的工程级解析]]>https://blog.youkuaiyun.com/Raymond_yang1102/article/details/165888376https://blog.youkuaiyun.com/Raymond_yang1102/article/details/165888376Raymond_yang1102Fri, 18 Sep 2026 19:06:33 +0800<![CDATA[接雨水：为什么多数人写不出 O(n) 的栈解法？——从暴力到双指针到单调栈的工程化选择]]>https://blog.youkuaiyun.com/Raymond_yang1102/article/details/165755315https://blog.youkuaiyun.com/Raymond_yang1102/article/details/165755315Raymond_yang1102Thu, 17 Sep 2026 18:53:41 +0800<![CDATA[Top K 工程实战：从热搜榜到第 K 大元素，为什么 80% 候选人栽在「快排分区 vs 堆」的二选一？]]>https://blog.youkuaiyun.com/Raymond_yang1102/article/details/165241040https://blog.youkuaiyun.com/Raymond_yang1102/article/details/165241040Raymond_yang1102Sun, 13 Sep 2026 18:25:07 +0800<![CDATA[双指针 + 滑动窗口：为什么这两招能压到 O(n)？——从秋招最高频模式看 O(n) 解法的工程取舍]]>https://blog.youkuaiyun.com/Raymond_yang1102/article/details/164629739https://blog.youkuaiyun.com/Raymond_yang1102/article/details/164629739Raymond_yang1102Tue, 08 Sep 2026 18:37:48 +0800<![CDATA[最短路径：从 BFS 到 Dijkstra、Bellman-Ford、Floyd——三种改写层序的进路，为什么 Dijkstra 必须用优先队列？]]>https://blog.youkuaiyun.com/Raymond_yang1102/article/details/164483820https://blog.youkuaiyun.com/Raymond_yang1102/article/details/164483820Raymond_yang1102Mon, 07 Sep 2026 18:36:26 +0800<![CDATA[图论基础：BFS 与 DFS 从模板到应用——同样的遍历，为什么有时用队列有时用递归？]]>https://blog.youkuaiyun.com/Raymond_yang1102/article/details/164340099https://blog.youkuaiyun.com/Raymond_yang1102/article/details/164340099Raymond_yang1102Thu, 03 Sep 2026 21:08:12 +0800<![CDATA[为什么TopK问题都要用堆？堆与优先队列的工程级演进解析]]>https://blog.youkuaiyun.com/Raymond_yang1102/article/details/164000877https://blog.youkuaiyun.com/Raymond_yang1102/article/details/164000877Raymond_yang1102Sun, 23 Aug 2026 18:46:57 +0800<![CDATA[为什么MySQL索引用B+树不用红黑树？从二叉树到B+树的工程级演进解析]]>https://blog.youkuaiyun.com/Raymond_yang1102/article/details/163979435https://blog.youkuaiyun.com/Raymond_yang1102/article/details/163979435Raymond_yang1102Sat, 22 Aug 2026 19:42:45 +0800<![CDATA[为什么Java HashMap的链表超过8就转红黑树？从哈希函数到冲突解决的工程级深度解析]]>https://blog.youkuaiyun.com/Raymond_yang1102/article/details/163893552https://blog.youkuaiyun.com/Raymond_yang1102/article/details/163893552Raymond_yang1102Wed, 19 Aug 2026 18:13:28 +0800<![CDATA[栈与队列：从函数调用到消息队列，无处不在的受限表]]>https://blog.youkuaiyun.com/Raymond_yang1102/article/details/163803933https://blog.youkuaiyun.com/Raymond_yang1102/article/details/163803933Raymond_yang1102Sun, 16 Aug 2026 23:04:58 +0800<![CDATA[链表：指针串联的灵活锁链，为什么它能随便插删？]]>https://blog.youkuaiyun.com/Raymond_yang1102/article/details/163803865https://blog.youkuaiyun.com/Raymond_yang1102/article/details/163803865Raymond_yang1102Sun, 16 Aug 2026 22:55:46 +0800<![CDATA[数组：从内存模型到工程实现，重新理解这个最基础的数据结构]]>https://blog.youkuaiyun.com/Raymond_yang1102/article/details/163704374https://blog.youkuaiyun.com/Raymond_yang1102/article/details/163704374Raymond_yang1102Fri, 14 Aug 2026 18:32:28 +0800 1（几何增长）。若每次只扩容 1 个（线性增长），总搬迁 1+2+3+...+n = O(n²)，摊还 O(n)——这是新手常犯的致命错误。]]><![CDATA[【2024最新版】WireShark4.4.0安装教程（Windows11）]]>https://blog.youkuaiyun.com/Raymond_yang1102/article/details/142566977https://blog.youkuaiyun.com/Raymond_yang1102/article/details/142566977Raymond_yang1102Thu, 26 Sep 2024 18:02:15 +0800