<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Manacher on</title><link>https://h30306.github.io/blog/zh-tw/tags/manacher/</link><description>Recent content in Manacher on</description><generator>Hugo -- gohugo.io</generator><language>zh-tw</language><managingEditor>hwork0511@gmail.com (Wei Yi Chung)</managingEditor><webMaster>hwork0511@gmail.com (Wei Yi Chung)</webMaster><copyright>© 2026 Wei Yi Chung</copyright><lastBuildDate>Thu, 20 Oct 2022 00:00:00 +0000</lastBuildDate><atom:link href="https://h30306.github.io/blog/zh-tw/tags/manacher/index.xml" rel="self" type="application/rss+xml"/><item><title>LeetCode 5: Longest Palindromic Substring</title><link>https://h30306.github.io/blog/zh-tw/leetcode/leetcode-5/</link><pubDate>Thu, 20 Oct 2022 00:00:00 +0000</pubDate><author>hwork0511@gmail.com (Wei Yi Chung)</author><guid>https://h30306.github.io/blog/zh-tw/leetcode/leetcode-5/</guid><description>LeetCode 5 解題筆記：中心擴展，每個位置當奇數和偶數長度的中心往外擴；區間 DP 的話 i 要從大到小</description><media:content xmlns:media="http://search.yahoo.com/mrss/" url="https://h30306.github.io/blog/leetcode/leetcode-5/featured.png"/></item></channel></rss>