<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom">
	<channel>
		<title>Algorithm on 春江暮客</title>
		<link>https://www.bobobk.com/tags/algorithm/</link>
		<description>Recent content in Algorithm on 春江暮客</description>
		<generator>Hugo</generator>
		<language>zh-cn</language>
		
		
		
		
			<lastBuildDate>Wed, 27 May 2026 20:34:00 +0000</lastBuildDate>
		
			<atom:link href="https://www.bobobk.com/tags/algorithm/index.xml" rel="self" type="application/rss+xml" />
			<item>
				<title>最大回文字符串算法Manacher</title>
				<link>https://www.bobobk.com/291.html</link>
				<pubDate>Thu, 28 Mar 2019 07:17:29 +0000</pubDate>
				<guid>https://www.bobobk.com/291.html</guid>
				<description>本文介绍 LeetCode 中最长回文子串问题的一种线性时间解法 Manacher，并结合变换字符串和 &lt;code&gt;Len&lt;/code&gt; 数组说明它为什么能做到 $O(n)$。</description>
			</item>
	</channel>
</rss>
