Rolling-Hash onhttps://h30306.github.io/blog/zh-tw/tags/rolling-hash/Recent content in Rolling-Hash onHugo -- gohugo.iozh-twhwork0511@gmail.com (Wei Yi Chung)hwork0511@gmail.com (Wei Yi Chung)© 2026 Wei Yi ChungWed, 01 Jul 2026 00:00:00 +0000LeetCode 1147: Longest Chunked Palindrome Decompositionhttps://h30306.github.io/blog/zh-tw/leetcode/leetcode-1147/Wed, 01 Jul 2026 00:00:00 +0000hwork0511@gmail.com (Wei Yi Chung)https://h30306.github.io/blog/zh-tw/leetcode/leetcode-1147/LeetCode 1147 解題筆記：從兩端同時往內累積字串，左右一相等就切成一對；越早切越好，剩下的中間（如果有）算一塊LeetCode 1461: Check If a String Contains All Binary Codes of Size Khttps://h30306.github.io/blog/zh-tw/leetcode/leetcode-1461/Mon, 05 Jan 2026 00:00:00 +0000hwork0511@gmail.com (Wei Yi Chung)https://h30306.github.io/blog/zh-tw/leetcode/leetcode-1461/LeetCode 1461 解題筆記：把所有長度 k 的子字串丟進集合，大小等於 2^k 就成立；最後一個起點是 len(s) - kLeetCode 2156: Find Substring With Given Hash Valuehttps://h30306.github.io/blog/zh-tw/leetcode/leetcode-2156/Sun, 04 Jan 2026 00:00:00 +0000hwork0511@gmail.com (Wei Yi Chung)https://h30306.github.io/blog/zh-tw/leetcode/leetcode-2156/LeetCode 2156 解題筆記：雜湊的第一個字元乘 p^0，從右往左滑動時只要乘 p 再加新字元、扣掉 p^k 倍的出去字元，不需要除法；modulo 不一定是質數，不能用模反元素