<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:content="http://purl.org/rss/1.0/modules/content/"><channel><title>LeetCode 208 on Jeanphilo Blog</title><link>https://shio-chan-dev.github.io/jeanblog/zh/tags/leetcode-208/</link><description>Recent content in LeetCode 208 on Jeanphilo Blog</description><generator>Hugo -- 0.163.3</generator><language>zh-cn</language><lastBuildDate>Wed, 24 Jun 2026 17:38:48 +0800</lastBuildDate><atom:link href="https://shio-chan-dev.github.io/jeanblog/zh/tags/leetcode-208/index.xml" rel="self" type="application/rss+xml"/><item><title>LeetCode 208：实现 Trie（前缀树）模板题解析</title><link>https://shio-chan-dev.github.io/jeanblog/zh/alg/leetcode/hot100/trie/208-implement-trie-prefix-tree/</link><pubDate>Wed, 24 Jun 2026 17:38:48 +0800</pubDate><guid>https://shio-chan-dev.github.io/jeanblog/zh/alg/leetcode/hot100/trie/208-implement-trie-prefix-tree/</guid><description>LeetCode 208 Implement Trie 是 Trie 模板题，核心是按固定接口实现 insert、search 和 startsWith。</description></item></channel></rss>