<?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 49 on Jeanphilo Blog</title><link>https://jeanphilogong.github.io/jeanblog/zh/tags/leetcode-49/</link><description>Recent content in LeetCode 49 on Jeanphilo Blog</description><generator>Hugo -- 0.168.0</generator><language>zh-cn</language><lastBuildDate>Sat, 10 Oct 2026 10:00:00 +0800</lastBuildDate><atom:link href="https://jeanphilogong.github.io/jeanblog/zh/tags/leetcode-49/index.xml" rel="self" type="application/rss+xml"/><item><title>LeetCode 49：字母异位词分组，从逐组比较到构造分组键</title><link>https://jeanphilogong.github.io/jeanblog/zh/alg/leetcode/hot100/49-group-anagrams/</link><pubDate>Sat, 10 Oct 2026 10:00:00 +0800</pubDate><guid>https://jeanphilogong.github.io/jeanblog/zh/alg/leetcode/hot100/49-group-anagrams/</guid><description>用 Python 从两个字符串的异位词判断出发，先写出逐组扫描的正确解，再推导排序键与字符计数键，理解哈希表分组为什么成立。</description></item></channel></rss>