<?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>Medium on 榎aaaa的个人主页</title><link>https://jiat-t.github.io/leetcode/substring/medium/</link><description>Recent content in Medium on 榎aaaa的个人主页</description><image><title>榎aaaa的个人主页</title><url>https://jiat-t.github.io/images/avatar.jpg</url><link>https://jiat-t.github.io/images/avatar.jpg</link></image><generator>Hugo</generator><language>zh-CN</language><lastBuildDate>Tue, 26 May 2026 01:41:00 +0000</lastBuildDate><atom:link href="https://jiat-t.github.io/leetcode/substring/medium/index.xml" rel="self" type="application/rss+xml"/><item><title>和为 K 的子数组</title><link>https://jiat-t.github.io/leetcode/substring/medium/leetcode-substring-medium/</link><pubDate>Mon, 04 May 2026 04:06:55 +0000</pubDate><guid>https://jiat-t.github.io/leetcode/substring/medium/leetcode-substring-medium/</guid><description>和为 K 的子数组的解题思路与 C++ 实现。</description></item></channel></rss>