Trie onhttps://h30306.github.io/blog/zh-tw/tags/trie/Recent content in Trie onHugo -- gohugo.iozh-twhwork0511@gmail.com (Wei Yi Chung)hwork0511@gmail.com (Wei Yi Chung)© 2026 Wei Yi ChungTue, 20 Oct 2026 00:00:00 +0000Trie 字典樹https://h30306.github.io/blog/zh-tw/algorithm/trie/Tue, 20 Oct 2026 00:00:00 +0000hwork0511@gmail.com (Wei Yi Chung)https://h30306.github.io/blog/zh-tw/algorithm/trie/用巢狀 dict 建 Trie、在節點上記數量、搭配 DFS 搜尋，以及什麼時候其實不需要 TrieLeetCode 212: Word Search IIhttps://h30306.github.io/blog/zh-tw/leetcode/leetcode-212/Fri, 16 Oct 2026 00:00:00 +0000hwork0511@gmail.com (Wei Yi Chung)https://h30306.github.io/blog/zh-tw/leetcode/leetcode-212/LeetCode 212 解題筆記：把所有單字建成 Trie，網格 DFS 時同步走 Trie，找到就移除、空節點就剪掉LeetCode 2416: Sum of Prefix Scores of Stringshttps://h30306.github.io/blog/zh-tw/leetcode/leetcode-2416/Sun, 13 Sep 2026 00:00:00 +0000hwork0511@gmail.com (Wei Yi Chung)https://h30306.github.io/blog/zh-tw/leetcode/leetcode-2416/LeetCode 2416 解題筆記：Trie 每個節點記錄經過的單字數，單字的答案就是沿路計數的總和LeetCode 1178: Number of Valid Words for Each Puzzlehttps://h30306.github.io/blog/zh-tw/leetcode/leetcode-1178/Fri, 28 Aug 2026 00:00:00 +0000hwork0511@gmail.com (Wei Yi Chung)https://h30306.github.io/blog/zh-tw/leetcode/leetcode-1178/LeetCode 1178 解題筆記：單字只在乎用了哪些字母，轉成 26-bit 遮罩計數，再枚舉謎題遮罩的所有子集合LeetCode 1023: Camelcase Matchinghttps://h30306.github.io/blog/zh-tw/leetcode/leetcode-1023/Thu, 19 Mar 2026 00:00:00 +0000hwork0511@gmail.com (Wei Yi Chung)https://h30306.github.io/blog/zh-tw/leetcode/leetcode-1023/LeetCode 1023 解題筆記：雙指針逐字比對，pattern 以外多出來的只能是小寫字母LeetCode 2781: Length of the Longest Valid Substringhttps://h30306.github.io/blog/zh-tw/leetcode/leetcode-2781/Wed, 14 Jan 2026 00:00:00 +0000hwork0511@gmail.com (Wei Yi Chung)https://h30306.github.io/blog/zh-tw/leetcode/leetcode-2781/LeetCode 2781 解題筆記：禁字最長只有 10，每個右端只檢查最後 10 個字元組成的後綴；找到禁字就把左端推到它後面，要找最短的那個（最靠右的起點）LeetCode 208: Implement Trie (Prefix Tree)https://h30306.github.io/blog/zh-tw/leetcode/leetcode-208/Sat, 29 Oct 2022 00:00:00 +0000hwork0511@gmail.com (Wei Yi Chung)https://h30306.github.io/blog/zh-tw/leetcode/leetcode-208/LeetCode 208 解題筆記：每個節點是 children 字典加一個 is_end 標記；insert、search、startsWith 都是沿著字元往下走LeetCode 14: Longest Common Prefixhttps://h30306.github.io/blog/zh-tw/leetcode/leetcode-14/Thu, 19 Sep 2019 00:00:00 +0000hwork0511@gmail.com (Wei Yi Chung)https://h30306.github.io/blog/zh-tw/leetcode/leetcode-14/LeetCode 14 解題筆記：用最短的字串當上限，逐個位置檢查所有字串是否相同，第一個不同的位置就是答案的長度