<?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>LPS数组 on Answer</title>
    <link>https://answer.freetools.me/tags/lps%E6%95%B0%E7%BB%84/</link>
    <description>Recent content in LPS数组 on Answer</description>
    <generator>Hugo -- 0.152.2</generator>
    <language>zh-cn</language>
    <lastBuildDate>Sun, 08 Mar 2026 22:16:39 +0800</lastBuildDate>
    <atom:link href="https://answer.freetools.me/tags/lps%E6%95%B0%E7%BB%84/index.xml" rel="self" type="application/rss+xml" />
    <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>
  </channel>
</rss>
