https://h30306.github.io/blog/zh-tw/tags/string-matching/Recent content in String-Matching onHugo -- gohugo.iozh-twhwork0511@gmail.com (Wei Yi Chung)hwork0511@gmail.com (Wei Yi Chung)© 2026 Wei Yi ChungWed, 07 Sep 2022 00:00:00 +0000https://h30306.github.io/blog/zh-tw/leetcode/leetcode-796/Wed, 07 Sep 2022 00:00:00 +0000hwork0511@gmail.com (Wei Yi Chung)https://h30306.github.io/blog/zh-tw/leetcode/leetcode-796/LeetCode 796 解題筆記：goal 是 s 的旋轉，等價於兩者長度相同而且 goal 出現在 s + s 裡https://h30306.github.io/blog/zh-tw/leetcode/leetcode-572/Sat, 27 Aug 2022 00:00:00 +0000hwork0511@gmail.com (Wei Yi Chung)https://h30306.github.io/blog/zh-tw/leetcode/leetcode-572/LeetCode 572 解題筆記：對 root 的每一個節點都檢查一次「以它為根的子樹跟 subRoot 是否相同」；遞迴時要呼叫 isSubtree，不是只比左右小孩https://h30306.github.io/blog/zh-tw/leetcode/leetcode-459/Wed, 24 Aug 2022 00:00:00 +0000hwork0511@gmail.com (Wei Yi Chung)https://h30306.github.io/blog/zh-tw/leetcode/leetcode-459/LeetCode 459 解題筆記：s 由某個子字串重複組成，等價於 s 出現在 (s + s) 去掉頭尾字元之後的字串裡https://h30306.github.io/blog/zh-tw/leetcode/leetcode-28/Wed, 11 May 2022 00:00:00 +0000hwork0511@gmail.com (Wei Yi Chung)https://h30306.github.io/blog/zh-tw/leetcode/leetcode-28/LeetCode 28 解題筆記：在每個起點比對 needle，或直接用 str.find；index 找不到會丟例外