<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Z-Algorithm on</title><link>https://h30306.github.io/blog/zh-tw/tags/z-algorithm/</link><description>Recent content in Z-Algorithm 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>Wed, 24 Aug 2022 00:00:00 +0000</lastBuildDate><atom:link href="https://h30306.github.io/blog/zh-tw/tags/z-algorithm/index.xml" rel="self" type="application/rss+xml"/><item><title>LeetCode 459: Repeated Substring Pattern</title><link>https://h30306.github.io/blog/zh-tw/leetcode/leetcode-459/</link><pubDate>Wed, 24 Aug 2022 00:00:00 +0000</pubDate><author>hwork0511@gmail.com (Wei Yi Chung)</author><guid>https://h30306.github.io/blog/zh-tw/leetcode/leetcode-459/</guid><description>LeetCode 459 解題筆記：s 由某個子字串重複組成，等價於 s 出現在 (s + s) 去掉頭尾字元之後的字串裡</description><media:content xmlns:media="http://search.yahoo.com/mrss/" url="https://h30306.github.io/blog/leetcode/leetcode-459/featured.png"/></item><item><title>LeetCode 28: Find the Index of the First Occurrence in a String</title><link>https://h30306.github.io/blog/zh-tw/leetcode/leetcode-28/</link><pubDate>Wed, 11 May 2022 00:00:00 +0000</pubDate><author>hwork0511@gmail.com (Wei Yi Chung)</author><guid>https://h30306.github.io/blog/zh-tw/leetcode/leetcode-28/</guid><description>LeetCode 28 解題筆記：在每個起點比對 needle，或直接用 str.find；index 找不到會丟例外</description><media:content xmlns:media="http://search.yahoo.com/mrss/" url="https://h30306.github.io/blog/leetcode/leetcode-28/featured.png"/></item></channel></rss>