<?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>Hash-Table on Hex4C59's Blog</title><link>http://hex4c59.cc/tags/hash-table/</link><description>Recent content in Hash-Table on Hex4C59's Blog</description><generator>Hugo -- 0.150.0</generator><language>zh-cn</language><lastBuildDate>Fri, 27 Mar 2026 15:18:58 +0800</lastBuildDate><atom:link href="http://hex4c59.cc/tags/hash-table/index.xml" rel="self" type="application/rss+xml"/><item><title>3. 无重复字符的最长子串</title><link>http://hex4c59.cc/leetcode/0003-longest-substring-without-repeating-characters/</link><pubDate>Wed, 25 Mar 2026 12:00:00 +0800</pubDate><guid>http://hex4c59.cc/leetcode/0003-longest-substring-without-repeating-characters/</guid><description>LeetCode 3 无重复字符的最长子串题解，使用不定长滑动窗口 + 哈希表维护窗口内字符状态。</description></item><item><title>3090. 每个字符最多出现两次的最长子字符串</title><link>http://hex4c59.cc/leetcode/3090-maximum-length-substring-with-two-occurrences/</link><pubDate>Wed, 25 Mar 2026 12:00:00 +0800</pubDate><guid>http://hex4c59.cc/leetcode/3090-maximum-length-substring-with-two-occurrences/</guid><description>LeetCode 3090 每个字符最多出现两次的最长子字符串题解，不定长滑动窗口的变体，限制窗口内每个字符出现次数不超过 2。</description></item><item><title>1. 两数之和</title><link>http://hex4c59.cc/leetcode/0001-two-sum/</link><pubDate>Sun, 22 Mar 2026 18:30:00 +0800</pubDate><guid>http://hex4c59.cc/leetcode/0001-two-sum/</guid><description>LeetCode 1 两数之和题解，包含暴力枚举与哈希表两种思路。</description></item></channel></rss>