<?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/%E5%AD%97%E7%AC%A6%E4%B8%B2%E5%93%88%E5%B8%8C/</link>
    <description>Recent content in 字符串哈希 on Answer</description>
    <generator>Hugo -- 0.152.2</generator>
    <language>zh-cn</language>
    <lastBuildDate>Sun, 08 Mar 2026 23:29:44 +0800</lastBuildDate>
    <atom:link href="https://answer.freetools.me/tags/%E5%AD%97%E7%AC%A6%E4%B8%B2%E5%93%88%E5%B8%8C/index.xml" rel="self" type="application/rss+xml" />
    <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>
  </channel>
</rss>
