https://aryido.github.io/tags/python/Recent content in python on Aryido Tech NoteHugo -- gohugo.ioen-usWed, 20 May 2026 09:30:14 +0800https://aryido.github.io/posts/algorithm/manacher/Wed, 20 May 2026 09:30:14 +0800https://aryido.github.io/posts/algorithm/manacher/<!-- raw HTML omitted --> <blockquote> <p>Manacher’s Algorithm (Manacher 的唸法<code>/ˈmænəkər/</code>)，用是來尋找字串中<a href="https://leetcode.com/problems/longest-palindromic-substring/description/">最長回文子串 (Longest Palindromic Substring)</a>的最好解法，時間複雜度可優化到了 <strong>O(n)</strong>。 由於算是<strong>是常考題</strong>，就花些時間了解一下吧。</p> </blockquote>https://aryido.github.io/posts/leetcode/leetcode5/Wed, 14 Sep 2022 22:30:14 +0800https://aryido.github.io/posts/leetcode/leetcode5/<!-- raw HTML omitted --> <blockquote> <p><strong><a href="https://leetcode.com/problems/longest-palindromic-substring/description/">最長回文子串 (Longest Palindromic Substring)</a> 是常考題</strong>。Palindrome 就是順讀逆讀，字母都一樣的詞語，比如範例給的 「 bab 」、 「 bb 」 等等，實際單字如 「 level 」 也是一個的 Palindromic 單字。</p> <p>先熟悉「 Dynamic Programming - 2D matrix 」解和「 中心擴散法 (Expand Around Center) 」就好了，還有聽過最佳解 Manacher&rsquo;s Algorithm，時間複雜度可優化到了 <strong>O(n)</strong>，之後再花其他篇幅去補充。</p> </blockquote>