https://answer.freetools.me/tags/%E5%AD%97%E7%AC%A6%E4%B8%B2%E5%8C%B9%E9%85%8D/ Recent content in 字符串匹配 on Answer Hugo -- 0.152.2 zh-cn Sun, 08 Mar 2026 23:35:49 +0800 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/ Sun, 08 Mar 2026 23:35:49 +0800 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/ 深度解析最长公共子序列(LCS)算法的核心原理，从状态转移方程推导到空间优化技巧，完整覆盖LeetCode经典题目（1143/583/718/516/1092/1312等）的Java解法，并探讨其在Git diff、DNA序列比对等实际场景中的应用。 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/ Sun, 08 Mar 2026 22:16:39 +0800 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/ 一篇系统讲解字符串匹配算法的深度教程，从朴素匹配的O(nm)到KMP的O(n+m)，深入剖析LPS数组、Z函数、滚动哈希的原理与实现，结合LeetCode经典题目（strStr、Repeated Substring Pattern、Longest Happy Prefix、Shortest Palindrome）的完整Java解答与复杂度分析。 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/ Sun, 08 Mar 2026 20:47:56 +0800 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/ 一篇系统讲解字典树(Trie)数据结构的深度教程，从核心原理到LeetCode经典题目（208/211/212/421/648/677/720/1268等）的完整Java实现与复杂度分析，涵盖前缀匹配、自动补全、IP路由等实际应用场景。