<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:content="http://purl.org/rss/1.0/modules/content/">
  <channel>
    <title>算法 on Answer</title>
    <link>https://answer.freetools.me/tags/%E7%AE%97%E6%B3%95/</link>
    <description>Recent content in 算法 on Answer</description>
    <generator>Hugo -- 0.152.2</generator>
    <language>zh-cn</language>
    <lastBuildDate>Sat, 21 Mar 2026 08:41:48 +0800</lastBuildDate>
    <atom:link href="https://answer.freetools.me/tags/%E7%AE%97%E6%B3%95/index.xml" rel="self" type="application/rss+xml" />
    <item>
      <title>代码搜索引擎如何在毫秒级遍历百万行代码：从正则引擎革命到Trigram索引的技术突围</title>
      <link>https://answer.freetools.me/%E4%BB%A3%E7%A0%81%E6%90%9C%E7%B4%A2%E5%BC%95%E6%93%8E%E5%A6%82%E4%BD%95%E5%9C%A8%E6%AF%AB%E7%A7%92%E7%BA%A7%E9%81%8D%E5%8E%86%E7%99%BE%E4%B8%87%E8%A1%8C%E4%BB%A3%E7%A0%81%E4%BB%8E%E6%AD%A3%E5%88%99%E5%BC%95%E6%93%8E%E9%9D%A9%E5%91%BD%E5%88%B0trigram%E7%B4%A2%E5%BC%95%E7%9A%84%E6%8A%80%E6%9C%AF%E7%AA%81%E5%9B%B4/</link>
      <pubDate>Sat, 21 Mar 2026 08:41:48 +0800</pubDate>
      <guid>https://answer.freetools.me/%E4%BB%A3%E7%A0%81%E6%90%9C%E7%B4%A2%E5%BC%95%E6%93%8E%E5%A6%82%E4%BD%95%E5%9C%A8%E6%AF%AB%E7%A7%92%E7%BA%A7%E9%81%8D%E5%8E%86%E7%99%BE%E4%B8%87%E8%A1%8C%E4%BB%A3%E7%A0%81%E4%BB%8E%E6%AD%A3%E5%88%99%E5%BC%95%E6%93%8E%E9%9D%A9%E5%91%BD%E5%88%B0trigram%E7%B4%A2%E5%BC%95%E7%9A%84%E6%8A%80%E6%9C%AF%E7%AA%81%E5%9B%B4/</guid>
      <description>深入解析现代代码搜索技术的底层原理：从ripgrep利用SIMD指令和非回溯引擎实现的百倍性能提升，到企业级工具通过Trigram索引将正则查询转化为集合运算的架构智慧。涵盖Thompson NFA、有限状态机、倒排索引与Rabin指纹等核心技术，揭示代码搜索如何突破传统文本匹配的物理极限。</description>
    </item>
    <item>
      <title>无损压缩如何工作：从香农信息论到现代算法的七十年演进</title>
      <link>https://answer.freetools.me/%E6%97%A0%E6%8D%9F%E5%8E%8B%E7%BC%A9%E5%A6%82%E4%BD%95%E5%B7%A5%E4%BD%9C%E4%BB%8E%E9%A6%99%E5%86%9C%E4%BF%A1%E6%81%AF%E8%AE%BA%E5%88%B0%E7%8E%B0%E4%BB%A3%E7%AE%97%E6%B3%95%E7%9A%84%E4%B8%83%E5%8D%81%E5%B9%B4%E6%BC%94%E8%BF%9B/</link>
      <pubDate>Sun, 15 Mar 2026 05:15:47 +0800</pubDate>
      <guid>https://answer.freetools.me/%E6%97%A0%E6%8D%9F%E5%8E%8B%E7%BC%A9%E5%A6%82%E4%BD%95%E5%B7%A5%E4%BD%9C%E4%BB%8E%E9%A6%99%E5%86%9C%E4%BF%A1%E6%81%AF%E8%AE%BA%E5%88%B0%E7%8E%B0%E4%BB%A3%E7%AE%97%E6%B3%95%E7%9A%84%E4%B8%83%E5%8D%81%E5%B9%B4%E6%BC%94%E8%BF%9B/</guid>
      <description>从香农信息论的数学基础到现代压缩算法的工程实践，深入解析无损压缩技术的七十年演进历程。涵盖霍夫曼编码、算术编码、LZ77、DEFLATE、Zstandard、Brotli、LZMA等核心算法的设计思想与技术权衡。</description>
    </item>
    <item>
      <title>编译器寄存器分配：从图着色到线性扫描的四十年算法博弈</title>
      <link>https://answer.freetools.me/%E7%BC%96%E8%AF%91%E5%99%A8%E5%AF%84%E5%AD%98%E5%99%A8%E5%88%86%E9%85%8D%E4%BB%8E%E5%9B%BE%E7%9D%80%E8%89%B2%E5%88%B0%E7%BA%BF%E6%80%A7%E6%89%AB%E6%8F%8F%E7%9A%84%E5%9B%9B%E5%8D%81%E5%B9%B4%E7%AE%97%E6%B3%95%E5%8D%9A%E5%BC%88/</link>
      <pubDate>Wed, 11 Mar 2026 08:31:44 +0800</pubDate>
      <guid>https://answer.freetools.me/%E7%BC%96%E8%AF%91%E5%99%A8%E5%AF%84%E5%AD%98%E5%99%A8%E5%88%86%E9%85%8D%E4%BB%8E%E5%9B%BE%E7%9D%80%E8%89%B2%E5%88%B0%E7%BA%BF%E6%80%A7%E6%89%AB%E6%8F%8F%E7%9A%84%E5%9B%9B%E5%8D%81%E5%B9%B4%E7%AE%97%E6%B3%95%E5%8D%9A%E5%BC%88/</guid>
      <description>深入解析编译器寄存器分配算法的演进历程：从1982年Chaitin开创性的图着色方法，到Briggs的乐观着色改进，再到George-Appel的迭代寄存器合并和线性扫描算法的革命性突破。涵盖LLVM与Go编译器的实际实现、性能权衡分析，以及NP完全问题的启发式解决方案。</description>
    </item>
    <item>
      <title>扫描线算法如何将二维问题降维成一维从天际线到矩形面积的LeetCode完整通关指南</title>
      <link>https://answer.freetools.me/%E6%89%AB%E6%8F%8F%E7%BA%BF%E7%AE%97%E6%B3%95%E5%A6%82%E4%BD%95%E5%B0%86%E4%BA%8C%E7%BB%B4%E9%97%AE%E9%A2%98%E9%99%8D%E7%BB%B4%E6%88%90%E4%B8%80%E7%BB%B4%E4%BB%8E%E5%A4%A9%E9%99%85%E7%BA%BF%E5%88%B0%E7%9F%A9%E5%BD%A2%E9%9D%A2%E7%A7%AF%E7%9A%84leetcode%E5%AE%8C%E6%95%B4%E9%80%9A%E5%85%B3%E6%8C%87%E5%8D%97/</link>
      <pubDate>Sun, 08 Mar 2026 23:45:39 +0800</pubDate>
      <guid>https://answer.freetools.me/%E6%89%AB%E6%8F%8F%E7%BA%BF%E7%AE%97%E6%B3%95%E5%A6%82%E4%BD%95%E5%B0%86%E4%BA%8C%E7%BB%B4%E9%97%AE%E9%A2%98%E9%99%8D%E7%BB%B4%E6%88%90%E4%B8%80%E7%BB%B4%E4%BB%8E%E5%A4%A9%E9%99%85%E7%BA%BF%E5%88%B0%E7%9F%A9%E5%BD%A2%E9%9D%A2%E7%A7%AF%E7%9A%84leetcode%E5%AE%8C%E6%95%B4%E9%80%9A%E5%85%B3%E6%8C%87%E5%8D%97/</guid>
      <description>深度解析扫描线算法的核心原理与应用，从1976年Shamos-Hoey算法的历史突破到LeetCode经典题目的完整Java解法。覆盖一维区间问题（会议室调度、人口统计、拼车问题）和二维几何问题（天际线、矩形面积并集、完美矩形、下落的方块），揭示事件驱动扫描的统一框架与降维艺术。</description>
    </item>
    <item>
      <title>最长公共子序列为何能解决十几类LeetCode问题从字符串相似度到DNA比对的动态规划精髓</title>
      <link>https://answer.freetools.me/%E6%9C%80%E9%95%BF%E5%85%AC%E5%85%B1%E5%AD%90%E5%BA%8F%E5%88%97%E4%B8%BA%E4%BD%95%E8%83%BD%E8%A7%A3%E5%86%B3%E5%8D%81%E5%87%A0%E7%B1%BBleetcode%E9%97%AE%E9%A2%98%E4%BB%8E%E5%AD%97%E7%AC%A6%E4%B8%B2%E7%9B%B8%E4%BC%BC%E5%BA%A6%E5%88%B0dna%E6%AF%94%E5%AF%B9%E7%9A%84%E5%8A%A8%E6%80%81%E8%A7%84%E5%88%92%E7%B2%BE%E9%AB%93/</link>
      <pubDate>Sun, 08 Mar 2026 23:35:49 +0800</pubDate>
      <guid>https://answer.freetools.me/%E6%9C%80%E9%95%BF%E5%85%AC%E5%85%B1%E5%AD%90%E5%BA%8F%E5%88%97%E4%B8%BA%E4%BD%95%E8%83%BD%E8%A7%A3%E5%86%B3%E5%8D%81%E5%87%A0%E7%B1%BBleetcode%E9%97%AE%E9%A2%98%E4%BB%8E%E5%AD%97%E7%AC%A6%E4%B8%B2%E7%9B%B8%E4%BC%BC%E5%BA%A6%E5%88%B0dna%E6%AF%94%E5%AF%B9%E7%9A%84%E5%8A%A8%E6%80%81%E8%A7%84%E5%88%92%E7%B2%BE%E9%AB%93/</guid>
      <description>深度解析最长公共子序列(LCS)算法的核心原理，从状态转移方程推导到空间优化技巧，完整覆盖LeetCode经典题目（1143/583/718/516/1092/1312等）的Java解法，并探讨其在Git diff、DNA序列比对等实际场景中的应用。</description>
    </item>
    <item>
      <title>字符串哈希如何用O(1)时间判断两个子串是否相等</title>
      <link>https://answer.freetools.me/%E5%AD%97%E7%AC%A6%E4%B8%B2%E5%93%88%E5%B8%8C%E5%A6%82%E4%BD%95%E7%94%A8o1%E6%97%B6%E9%97%B4%E5%88%A4%E6%96%AD%E4%B8%A4%E4%B8%AA%E5%AD%90%E4%B8%B2%E6%98%AF%E5%90%A6%E7%9B%B8%E7%AD%89/</link>
      <pubDate>Sun, 08 Mar 2026 23:29:44 +0800</pubDate>
      <guid>https://answer.freetools.me/%E5%AD%97%E7%AC%A6%E4%B8%B2%E5%93%88%E5%B8%8C%E5%A6%82%E4%BD%95%E7%94%A8o1%E6%97%B6%E9%97%B4%E5%88%A4%E6%96%AD%E4%B8%A4%E4%B8%AA%E5%AD%90%E4%B8%B2%E6%98%AF%E5%90%A6%E7%9B%B8%E7%AD%89/</guid>
      <description>深入解析字符串哈希的核心原理与滚动哈希优化，从多项式哈希的数学基础到Rabin-Karp算法的工程实现，完整覆盖LeetCode经典题目的Java解法，包括最长重复子串、重复DNA序列、最长重复子数组等核心问题的分治与二分优化方案。</description>
    </item>
    <item>
      <title>链表算法为何让无数开发者头疼从指针陷阱到快慢指针的完整LeetCode通关指南</title>
      <link>https://answer.freetools.me/%E9%93%BE%E8%A1%A8%E7%AE%97%E6%B3%95%E4%B8%BA%E4%BD%95%E8%AE%A9%E6%97%A0%E6%95%B0%E5%BC%80%E5%8F%91%E8%80%85%E5%A4%B4%E7%96%BC%E4%BB%8E%E6%8C%87%E9%92%88%E9%99%B7%E9%98%B1%E5%88%B0%E5%BF%AB%E6%85%A2%E6%8C%87%E9%92%88%E7%9A%84%E5%AE%8C%E6%95%B4leetcode%E9%80%9A%E5%85%B3%E6%8C%87%E5%8D%97/</link>
      <pubDate>Sun, 08 Mar 2026 23:08:48 +0800</pubDate>
      <guid>https://answer.freetools.me/%E9%93%BE%E8%A1%A8%E7%AE%97%E6%B3%95%E4%B8%BA%E4%BD%95%E8%AE%A9%E6%97%A0%E6%95%B0%E5%BC%80%E5%8F%91%E8%80%85%E5%A4%B4%E7%96%BC%E4%BB%8E%E6%8C%87%E9%92%88%E9%99%B7%E9%98%B1%E5%88%B0%E5%BF%AB%E6%85%A2%E6%8C%87%E9%92%88%E7%9A%84%E5%AE%8C%E6%95%B4leetcode%E9%80%9A%E5%85%B3%E6%8C%87%E5%8D%97/</guid>
      <description>一篇深度讲解链表算法的完整指南，从历史背景到核心概念，涵盖虚拟头节点、双指针、快慢指针、反转链表等核心技巧，结合LeetCode经典题目（206/141/142/21/19/876/160/234/143/148/25/138等）的完整Java实现与复杂度分析。</description>
    </item>
    <item>
      <title>单调队列算法如何在滑动窗口中保持O(n)时间复杂度</title>
      <link>https://answer.freetools.me/%E5%8D%95%E8%B0%83%E9%98%9F%E5%88%97%E7%AE%97%E6%B3%95%E5%A6%82%E4%BD%95%E5%9C%A8%E6%BB%91%E5%8A%A8%E7%AA%97%E5%8F%A3%E4%B8%AD%E4%BF%9D%E6%8C%81on%E6%97%B6%E9%97%B4%E5%A4%8D%E6%9D%82%E5%BA%A6/</link>
      <pubDate>Sun, 08 Mar 2026 22:44:34 +0800</pubDate>
      <guid>https://answer.freetools.me/%E5%8D%95%E8%B0%83%E9%98%9F%E5%88%97%E7%AE%97%E6%B3%95%E5%A6%82%E4%BD%95%E5%9C%A8%E6%BB%91%E5%8A%A8%E7%AA%97%E5%8F%A3%E4%B8%AD%E4%BF%9D%E6%8C%81on%E6%97%B6%E9%97%B4%E5%A4%8D%E6%9D%82%E5%BA%A6/</guid>
      <description>一篇系统讲解单调队列算法的深度教程，从核心原理到两种类型（单调递增/递减队列），结合LeetCode经典题目（239/862/1438/1696等）的完整Java实现与复杂度分析，帮助你彻底掌握这一面试高频算法模式。</description>
    </item>
    <item>
      <title>背包问题为何成为动态规划的基石从01背包到完全背包的完整LeetCode通关指南</title>
      <link>https://answer.freetools.me/%E8%83%8C%E5%8C%85%E9%97%AE%E9%A2%98%E4%B8%BA%E4%BD%95%E6%88%90%E4%B8%BA%E5%8A%A8%E6%80%81%E8%A7%84%E5%88%92%E7%9A%84%E5%9F%BA%E7%9F%B3%E4%BB%8E01%E8%83%8C%E5%8C%85%E5%88%B0%E5%AE%8C%E5%85%A8%E8%83%8C%E5%8C%85%E7%9A%84%E5%AE%8C%E6%95%B4leetcode%E9%80%9A%E5%85%B3%E6%8C%87%E5%8D%97/</link>
      <pubDate>Sun, 08 Mar 2026 22:38:14 +0800</pubDate>
      <guid>https://answer.freetools.me/%E8%83%8C%E5%8C%85%E9%97%AE%E9%A2%98%E4%B8%BA%E4%BD%95%E6%88%90%E4%B8%BA%E5%8A%A8%E6%80%81%E8%A7%84%E5%88%92%E7%9A%84%E5%9F%BA%E7%9F%B3%E4%BB%8E01%E8%83%8C%E5%8C%85%E5%88%B0%E5%AE%8C%E5%85%A8%E8%83%8C%E5%8C%85%E7%9A%84%E5%AE%8C%E6%95%B4leetcode%E9%80%9A%E5%85%B3%E6%8C%87%E5%8D%97/</guid>
      <description>一篇系统讲解背包问题的深度教程，从01背包、完全背包到多重背包的状态转移方程与空间优化技巧，结合LeetCode经典题目（416/494/518/322/474/1049/279/139等）的完整Java实现与复杂度分析，帮助彻底掌握这一动态规划核心专题。</description>
    </item>
    <item>
      <title>字符串匹配算法为何如此重要从KMP到Z函数的线性时间突围</title>
      <link>https://answer.freetools.me/%E5%AD%97%E7%AC%A6%E4%B8%B2%E5%8C%B9%E9%85%8D%E7%AE%97%E6%B3%95%E4%B8%BA%E4%BD%95%E5%A6%82%E6%AD%A4%E9%87%8D%E8%A6%81%E4%BB%8Ekmp%E5%88%B0z%E5%87%BD%E6%95%B0%E7%9A%84%E7%BA%BF%E6%80%A7%E6%97%B6%E9%97%B4%E7%AA%81%E5%9B%B4/</link>
      <pubDate>Sun, 08 Mar 2026 22:16:39 +0800</pubDate>
      <guid>https://answer.freetools.me/%E5%AD%97%E7%AC%A6%E4%B8%B2%E5%8C%B9%E9%85%8D%E7%AE%97%E6%B3%95%E4%B8%BA%E4%BD%95%E5%A6%82%E6%AD%A4%E9%87%8D%E8%A6%81%E4%BB%8Ekmp%E5%88%B0z%E5%87%BD%E6%95%B0%E7%9A%84%E7%BA%BF%E6%80%A7%E6%97%B6%E9%97%B4%E7%AA%81%E5%9B%B4/</guid>
      <description>一篇系统讲解字符串匹配算法的深度教程，从朴素匹配的O(nm)到KMP的O(n&#43;m)，深入剖析LPS数组、Z函数、滚动哈希的原理与实现，结合LeetCode经典题目（strStr、Repeated Substring Pattern、Longest Happy Prefix、Shortest Palindrome）的完整Java解答与复杂度分析。</description>
    </item>
    <item>
      <title>数论算法为何成为LeetCode的隐藏Boss从素数筛到快速幂的完整通关指南</title>
      <link>https://answer.freetools.me/%E6%95%B0%E8%AE%BA%E7%AE%97%E6%B3%95%E4%B8%BA%E4%BD%95%E6%88%90%E4%B8%BAleetcode%E7%9A%84%E9%9A%90%E8%97%8Fboss%E4%BB%8E%E7%B4%A0%E6%95%B0%E7%AD%9B%E5%88%B0%E5%BF%AB%E9%80%9F%E5%B9%82%E7%9A%84%E5%AE%8C%E6%95%B4%E9%80%9A%E5%85%B3%E6%8C%87%E5%8D%97/</link>
      <pubDate>Sun, 08 Mar 2026 22:09:59 +0800</pubDate>
      <guid>https://answer.freetools.me/%E6%95%B0%E8%AE%BA%E7%AE%97%E6%B3%95%E4%B8%BA%E4%BD%95%E6%88%90%E4%B8%BAleetcode%E7%9A%84%E9%9A%90%E8%97%8Fboss%E4%BB%8E%E7%B4%A0%E6%95%B0%E7%AD%9B%E5%88%B0%E5%BF%AB%E9%80%9F%E5%B9%82%E7%9A%84%E5%AE%8C%E6%95%B4%E9%80%9A%E5%85%B3%E6%8C%87%E5%8D%97/</guid>
      <description>一篇系统讲解数论算法的深度教程，从素数筛（埃氏筛、欧拉筛）到GCD/LCM（欧几里得算法），从快速幂（二进制快速幂）到质因数分解，结合LeetCode经典题目（Count Primes、Ugly Number、Pow(x,n)、GCD相关等）的完整Java实现与复杂度分析。</description>
    </item>
    <item>
      <title>位运算为何能让一行代码抵十行循环从底层原理到LeetCode完整通关指南</title>
      <link>https://answer.freetools.me/%E4%BD%8D%E8%BF%90%E7%AE%97%E4%B8%BA%E4%BD%95%E8%83%BD%E8%AE%A9%E4%B8%80%E8%A1%8C%E4%BB%A3%E7%A0%81%E6%8A%B5%E5%8D%81%E8%A1%8C%E5%BE%AA%E7%8E%AF%E4%BB%8E%E5%BA%95%E5%B1%82%E5%8E%9F%E7%90%86%E5%88%B0leetcode%E5%AE%8C%E6%95%B4%E9%80%9A%E5%85%B3%E6%8C%87%E5%8D%97/</link>
      <pubDate>Sun, 08 Mar 2026 22:03:27 +0800</pubDate>
      <guid>https://answer.freetools.me/%E4%BD%8D%E8%BF%90%E7%AE%97%E4%B8%BA%E4%BD%95%E8%83%BD%E8%AE%A9%E4%B8%80%E8%A1%8C%E4%BB%A3%E7%A0%81%E6%8A%B5%E5%8D%81%E8%A1%8C%E5%BE%AA%E7%8E%AF%E4%BB%8E%E5%BA%95%E5%B1%82%E5%8E%9F%E7%90%86%E5%88%B0leetcode%E5%AE%8C%E6%95%B4%E9%80%9A%E5%85%B3%E6%8C%87%E5%8D%97/</guid>
      <description>一篇系统讲解位运算的深度教程，从二进制基础到Brian Kernighan算法，从XOR性质到lowbit技巧，结合LeetCode经典题目（Single Number系列、Counting Bits、Hamming Distance、Sum of Two Integers等）的完整Java实现与复杂度分析。</description>
    </item>
    <item>
      <title>字典树（Trie）：用共享前缀把字符串检索从O(n)降到O(L)</title>
      <link>https://answer.freetools.me/%E5%AD%97%E5%85%B8%E6%A0%91trie%E7%94%A8%E5%85%B1%E4%BA%AB%E5%89%8D%E7%BC%80%E6%8A%8A%E5%AD%97%E7%AC%A6%E4%B8%B2%E6%A3%80%E7%B4%A2%E4%BB%8Eon%E9%99%8D%E5%88%B0ol/</link>
      <pubDate>Sun, 08 Mar 2026 20:47:56 +0800</pubDate>
      <guid>https://answer.freetools.me/%E5%AD%97%E5%85%B8%E6%A0%91trie%E7%94%A8%E5%85%B1%E4%BA%AB%E5%89%8D%E7%BC%80%E6%8A%8A%E5%AD%97%E7%AC%A6%E4%B8%B2%E6%A3%80%E7%B4%A2%E4%BB%8Eon%E9%99%8D%E5%88%B0ol/</guid>
      <description>一篇系统讲解字典树(Trie)数据结构的深度教程，从核心原理到LeetCode经典题目（208/211/212/421/648/677/720/1268等）的完整Java实现与复杂度分析，涵盖前缀匹配、自动补全、IP路由等实际应用场景。</description>
    </item>
    <item>
      <title>并查集：从社交网络连通性到LeetCode通关的完整指南</title>
      <link>https://answer.freetools.me/%E5%B9%B6%E6%9F%A5%E9%9B%86%E4%BB%8E%E7%A4%BE%E4%BA%A4%E7%BD%91%E7%BB%9C%E8%BF%9E%E9%80%9A%E6%80%A7%E5%88%B0leetcode%E9%80%9A%E5%85%B3%E7%9A%84%E5%AE%8C%E6%95%B4%E6%8C%87%E5%8D%97/</link>
      <pubDate>Sun, 08 Mar 2026 20:39:07 +0800</pubDate>
      <guid>https://answer.freetools.me/%E5%B9%B6%E6%9F%A5%E9%9B%86%E4%BB%8E%E7%A4%BE%E4%BA%A4%E7%BD%91%E7%BB%9C%E8%BF%9E%E9%80%9A%E6%80%A7%E5%88%B0leetcode%E9%80%9A%E5%85%B3%E7%9A%84%E5%AE%8C%E6%95%B4%E6%8C%87%E5%8D%97/</guid>
      <description>一篇系统讲解并查集数据结构的深度教程，从核心原理到路径压缩与按秩合并的优化技巧，结合LeetCode经典题目（547/684/721/990/765/947/1202/1319/952/1697等）的完整Java实现与复杂度分析，帮助彻底掌握这一面试高频数据结构。</description>
    </item>
    <item>
      <title>单调栈算法:如何用O(n)时间找到下一个更大元素</title>
      <link>https://answer.freetools.me/%E5%8D%95%E8%B0%83%E6%A0%88%E7%AE%97%E6%B3%95%E5%A6%82%E4%BD%95%E7%94%A8on%E6%97%B6%E9%97%B4%E6%89%BE%E5%88%B0%E4%B8%8B%E4%B8%80%E4%B8%AA%E6%9B%B4%E5%A4%A7%E5%85%83%E7%B4%A0/</link>
      <pubDate>Sun, 08 Mar 2026 20:11:10 +0800</pubDate>
      <guid>https://answer.freetools.me/%E5%8D%95%E8%B0%83%E6%A0%88%E7%AE%97%E6%B3%95%E5%A6%82%E4%BD%95%E7%94%A8on%E6%97%B6%E9%97%B4%E6%89%BE%E5%88%B0%E4%B8%8B%E4%B8%80%E4%B8%AA%E6%9B%B4%E5%A4%A7%E5%85%83%E7%B4%A0/</guid>
      <description>一篇系统讲解单调栈算法的深度教程，从核心原理到四种类型（单调递增/递减栈），结合LeetCode经典题目（496/503/739/42/84/402/316等）的完整Java实现与复杂度分析，帮助你彻底掌握这一面试高频算法模式。</description>
    </item>
    <item>
      <title>回溯算法:从决策树到剪枝优化的完整LeetCode通关指南</title>
      <link>https://answer.freetools.me/%E5%9B%9E%E6%BA%AF%E7%AE%97%E6%B3%95%E4%BB%8E%E5%86%B3%E7%AD%96%E6%A0%91%E5%88%B0%E5%89%AA%E6%9E%9D%E4%BC%98%E5%8C%96%E7%9A%84%E5%AE%8C%E6%95%B4leetcode%E9%80%9A%E5%85%B3%E6%8C%87%E5%8D%97/</link>
      <pubDate>Sun, 08 Mar 2026 20:05:57 +0800</pubDate>
      <guid>https://answer.freetools.me/%E5%9B%9E%E6%BA%AF%E7%AE%97%E6%B3%95%E4%BB%8E%E5%86%B3%E7%AD%96%E6%A0%91%E5%88%B0%E5%89%AA%E6%9E%9D%E4%BC%98%E5%8C%96%E7%9A%84%E5%AE%8C%E6%95%B4leetcode%E9%80%9A%E5%85%B3%E6%8C%87%E5%8D%97/</guid>
      <description>一篇系统讲解回溯算法的完整指南，从核心原理到剪枝优化，涵盖排列、组合、子集、N皇后、数独等LeetCode经典题目（46/47/77/39/40/216/78/90/51/37/17/22/93/131/79等）的Java实现与复杂度分析。</description>
    </item>
    <item>
      <title>前缀和算法如何用一次预处理换来O(1)区间查询</title>
      <link>https://answer.freetools.me/%E5%89%8D%E7%BC%80%E5%92%8C%E7%AE%97%E6%B3%95%E5%A6%82%E4%BD%95%E7%94%A8%E4%B8%80%E6%AC%A1%E9%A2%84%E5%A4%84%E7%90%86%E6%8D%A2%E6%9D%A5o1%E5%8C%BA%E9%97%B4%E6%9F%A5%E8%AF%A2/</link>
      <pubDate>Sun, 08 Mar 2026 19:56:18 +0800</pubDate>
      <guid>https://answer.freetools.me/%E5%89%8D%E7%BC%80%E5%92%8C%E7%AE%97%E6%B3%95%E5%A6%82%E4%BD%95%E7%94%A8%E4%B8%80%E6%AC%A1%E9%A2%84%E5%A4%84%E7%90%86%E6%8D%A2%E6%9D%A5o1%E5%8C%BA%E9%97%B4%E6%9F%A5%E8%AF%A2/</guid>
      <description>一篇系统讲解前缀和算法的深度教程，从一维前缀和到二维矩阵前缀和，再到前缀和与哈希表的经典结合模式。结合LeetCode经典题目（303/304/560/974/523/437/1248等）的完整Java实现与复杂度分析，帮助你彻底掌握这一面试高频算法模式。</description>
    </item>
    <item>
      <title>滑动窗口算法：从暴力枚举到线性扫描的效率革命</title>
      <link>https://answer.freetools.me/%E6%BB%91%E5%8A%A8%E7%AA%97%E5%8F%A3%E7%AE%97%E6%B3%95%E4%BB%8E%E6%9A%B4%E5%8A%9B%E6%9E%9A%E4%B8%BE%E5%88%B0%E7%BA%BF%E6%80%A7%E6%89%AB%E6%8F%8F%E7%9A%84%E6%95%88%E7%8E%87%E9%9D%A9%E5%91%BD/</link>
      <pubDate>Sun, 08 Mar 2026 19:49:09 +0800</pubDate>
      <guid>https://answer.freetools.me/%E6%BB%91%E5%8A%A8%E7%AA%97%E5%8F%A3%E7%AE%97%E6%B3%95%E4%BB%8E%E6%9A%B4%E5%8A%9B%E6%9E%9A%E4%B8%BE%E5%88%B0%E7%BA%BF%E6%80%A7%E6%89%AB%E6%8F%8F%E7%9A%84%E6%95%88%E7%8E%87%E9%9D%A9%E5%91%BD/</guid>
      <description>一篇系统讲解滑动窗口算法的深度教程，从核心原理到两大类型（固定窗口与可变窗口），结合LeetCode经典题目（239/3/76/209/904/1004/713/424等）的完整Java实现与复杂度分析，帮助你彻底掌握这一面试高频算法模式。</description>
    </item>
    <item>
      <title>二分查找算法：从十个程序员九个错到LeetCode通关的完整指南</title>
      <link>https://answer.freetools.me/%E4%BA%8C%E5%88%86%E6%9F%A5%E6%89%BE%E7%AE%97%E6%B3%95%E4%BB%8E%E5%8D%81%E4%B8%AA%E7%A8%8B%E5%BA%8F%E5%91%98%E4%B9%9D%E4%B8%AA%E9%94%99%E5%88%B0leetcode%E9%80%9A%E5%85%B3%E7%9A%84%E5%AE%8C%E6%95%B4%E6%8C%87%E5%8D%97/</link>
      <pubDate>Sun, 08 Mar 2026 19:42:51 +0800</pubDate>
      <guid>https://answer.freetools.me/%E4%BA%8C%E5%88%86%E6%9F%A5%E6%89%BE%E7%AE%97%E6%B3%95%E4%BB%8E%E5%8D%81%E4%B8%AA%E7%A8%8B%E5%BA%8F%E5%91%98%E4%B9%9D%E4%B8%AA%E9%94%99%E5%88%B0leetcode%E9%80%9A%E5%85%B3%E7%9A%84%E5%AE%8C%E6%95%B4%E6%8C%87%E5%8D%97/</guid>
      <description>一篇深度讲解二分查找算法的完整指南，从历史背景（90%程序员写错的真相）到核心原理，涵盖标准模板、左边界右边界查找、答案空间二分、旋转数组等变体，以及LeetCode经典题目（704/35/34/69/33/153/162/875等）的完整Java实现与复杂度分析。</description>
    </item>
    <item>
      <title>双指针算法：从两次遍历到一次扫描的优雅降维</title>
      <link>https://answer.freetools.me/%E5%8F%8C%E6%8C%87%E9%92%88%E7%AE%97%E6%B3%95%E4%BB%8E%E4%B8%A4%E6%AC%A1%E9%81%8D%E5%8E%86%E5%88%B0%E4%B8%80%E6%AC%A1%E6%89%AB%E6%8F%8F%E7%9A%84%E4%BC%98%E9%9B%85%E9%99%8D%E7%BB%B4/</link>
      <pubDate>Sun, 08 Mar 2026 19:37:22 +0800</pubDate>
      <guid>https://answer.freetools.me/%E5%8F%8C%E6%8C%87%E9%92%88%E7%AE%97%E6%B3%95%E4%BB%8E%E4%B8%A4%E6%AC%A1%E9%81%8D%E5%8E%86%E5%88%B0%E4%B8%80%E6%AC%A1%E6%89%AB%E6%8F%8F%E7%9A%84%E4%BC%98%E9%9B%85%E9%99%8D%E7%BB%B4/</guid>
      <description>一篇系统讲解双指针算法的深度教程，从核心思想到三大类型（相向双指针、同向双指针、快慢指针），结合LeetCode经典题目（Two Sum II、3Sum、Container With Most Water、Trapping Rain Water、Linked List Cycle等）的完整Java实现与复杂度分析。</description>
    </item>
    <item>
      <title>动态规划算法入门：从暴力递归到状态转移的完整思维指南</title>
      <link>https://answer.freetools.me/%E5%8A%A8%E6%80%81%E8%A7%84%E5%88%92%E7%AE%97%E6%B3%95%E5%85%A5%E9%97%A8%E4%BB%8E%E6%9A%B4%E5%8A%9B%E9%80%92%E5%BD%92%E5%88%B0%E7%8A%B6%E6%80%81%E8%BD%AC%E7%A7%BB%E7%9A%84%E5%AE%8C%E6%95%B4%E6%80%9D%E7%BB%B4%E6%8C%87%E5%8D%97/</link>
      <pubDate>Sun, 08 Mar 2026 19:28:21 +0800</pubDate>
      <guid>https://answer.freetools.me/%E5%8A%A8%E6%80%81%E8%A7%84%E5%88%92%E7%AE%97%E6%B3%95%E5%85%A5%E9%97%A8%E4%BB%8E%E6%9A%B4%E5%8A%9B%E9%80%92%E5%BD%92%E5%88%B0%E7%8A%B6%E6%80%81%E8%BD%AC%E7%A7%BB%E7%9A%84%E5%AE%8C%E6%95%B4%E6%80%9D%E7%BB%B4%E6%8C%87%E5%8D%97/</guid>
      <description>一篇面向程序员的动态规划入门教程,从斐波那契数列的暴力递归问题出发,详细讲解动态规划的核心原理、实现方式和解题框架,并系统分析LeetCode上的经典动态规划题目,包括爬楼梯、打家劫舍、零钱兑换等,每道题目均提供完整的Java代码实现和复杂度分析。</description>
    </item>
  </channel>
</rss>
