<rss xmlns:atom="http://www.w3.org/2005/Atom" version="2.0">
    <channel>
        <title>String - 标签 - zwyyy456&#39;s blog</title>
        <link>https://doit.tellm.eu.org/zh/tags/string/</link>
        <description>String - 标签 - zwyyy456&#39;s blog</description>
        <generator>Hugo -- gohugo.io</generator><language>zh</language><managingEditor>zwyyy456@hotmail.com (zwyyy456)</managingEditor>
            <webMaster>zwyyy456@hotmail.com (zwyyy456)</webMaster><copyright>This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.</copyright><lastBuildDate>Mon, 15 May 2023 11:52:54 &#43;0800</lastBuildDate><atom:link href="https://doit.tellm.eu.org/zh/tags/string/" rel="self" type="application/rss+xml" /><item>
    <title>字符串哈希算法</title>
    <link>https://doit.tellm.eu.org/zh/string_hash/</link>
    <pubDate>Mon, 15 May 2023 11:52:54 &#43;0800</pubDate><author>
                    <name>zwyyy456</name>
                </author><guid>https://doit.tellm.eu.org/zh/string_hash/</guid>
    <description><![CDATA[1 问题描述考虑 1044. 最长重复子串 (Hard)，本题思路并不难，可以使用二分答案来解决，假设答案为 mid，那么长度大于 mid 的子串在 s 中只会出现一次，]]></description>
</item></channel>
</rss>
