<?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 on 榎aaaa的个人主页</title><link>https://jiat-t.github.io/categories/leetcode/</link><description>Recent content in LeetCode 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, 30 Jun 2026 04:18:45 +0000</lastBuildDate><atom:link href="https://jiat-t.github.io/categories/leetcode/index.xml" rel="self" type="application/rss+xml"/><item><title>整数反转</title><link>https://jiat-t.github.io/leetcode/string/medium/reverse-integer/</link><pubDate>Tue, 17 Mar 2026 07:29:04 +0000</pubDate><guid>https://jiat-t.github.io/leetcode/string/medium/reverse-integer/</guid><description>整数反转的解题思路与 C++ 实现。</description></item><item><title>字符串转换整数 (atoi)</title><link>https://jiat-t.github.io/leetcode/string/medium/string-to-integer-atoi/</link><pubDate>Tue, 17 Mar 2026 07:29:04 +0000</pubDate><guid>https://jiat-t.github.io/leetcode/string/medium/string-to-integer-atoi/</guid><description>字符串转换整数 (atoi)的解题思路与 C++ 实现。</description></item><item><title>回文数</title><link>https://jiat-t.github.io/leetcode/technique/easy/palindrome-number/</link><pubDate>Tue, 17 Mar 2026 07:29:04 +0000</pubDate><guid>https://jiat-t.github.io/leetcode/technique/easy/palindrome-number/</guid><description>回文数的解题思路与 C++ 实现。</description></item><item><title>最长公共前缀</title><link>https://jiat-t.github.io/leetcode/string/easy/longest-common-prefix/</link><pubDate>Tue, 17 Mar 2026 07:29:04 +0000</pubDate><guid>https://jiat-t.github.io/leetcode/string/easy/longest-common-prefix/</guid><description>最长公共前缀的解题思路与 C++ 实现。</description></item><item><title>移除元素</title><link>https://jiat-t.github.io/leetcode/double-pointers/easy/remove-element/</link><pubDate>Sat, 11 Apr 2026 05:23:52 +0000</pubDate><guid>https://jiat-t.github.io/leetcode/double-pointers/easy/remove-element/</guid><description>移除元素的解题思路与 C++ 实现。</description></item><item><title>最大子数组和</title><link>https://jiat-t.github.io/leetcode/array/medium/maximum-subarray/</link><pubDate>Tue, 21 Apr 2026 09:45:56 +0000</pubDate><guid>https://jiat-t.github.io/leetcode/array/medium/maximum-subarray/</guid><description>最大子数组和的解题思路与 C++ 实现。</description></item><item><title>合并区间</title><link>https://jiat-t.github.io/leetcode/array/medium/merge-intervals/</link><pubDate>Tue, 21 Apr 2026 09:45:56 +0000</pubDate><guid>https://jiat-t.github.io/leetcode/array/medium/merge-intervals/</guid><description>合并区间的解题思路与 C++ 实现。</description></item><item><title>最小覆盖子串</title><link>https://jiat-t.github.io/leetcode/substring/hard/leetcode-substring-hard/</link><pubDate>Wed, 03 Jun 2026 04:09:47 +0000</pubDate><guid>https://jiat-t.github.io/leetcode/substring/hard/leetcode-substring-hard/</guid><description>最小覆盖子串的解题思路与 C++ 实现。</description></item><item><title>柱状图中最大的矩形</title><link>https://jiat-t.github.io/leetcode/stack/hard/leetcode-stack-hard/</link><pubDate>Tue, 02 Jun 2026 04:40:08 +0000</pubDate><guid>https://jiat-t.github.io/leetcode/stack/hard/leetcode-stack-hard/</guid><description>柱状图中最大的矩形的解题思路与 C++ 实现。</description></item><item><title>二叉树中的最大路径和</title><link>https://jiat-t.github.io/leetcode/binary-tree/hard/leetcode-binary-tree-hard/</link><pubDate>Tue, 02 Jun 2026 14:00:22 +0000</pubDate><guid>https://jiat-t.github.io/leetcode/binary-tree/hard/leetcode-binary-tree-hard/</guid><description>二叉树中的最大路径和的解题思路与 C++ 实现。</description></item><item><title>验证回文串</title><link>https://jiat-t.github.io/leetcode/double-pointers/easy/valid-palindrome/</link><pubDate>Sat, 11 Apr 2026 05:23:52 +0000</pubDate><guid>https://jiat-t.github.io/leetcode/double-pointers/easy/valid-palindrome/</guid><description>验证回文串的解题思路与 C++ 实现。</description></item><item><title>库存管理 III</title><link>https://jiat-t.github.io/leetcode/heap/easy/leetcode-heap-easy/</link><pubDate>Mon, 25 May 2026 10:57:48 +0000</pubDate><guid>https://jiat-t.github.io/leetcode/heap/easy/leetcode-heap-easy/</guid><description>库存管理 III的解题思路与 C++ 实现。</description></item><item><title>轮转数组</title><link>https://jiat-t.github.io/leetcode/array/medium/rotate-array/</link><pubDate>Tue, 21 Apr 2026 09:45:56 +0000</pubDate><guid>https://jiat-t.github.io/leetcode/array/medium/rotate-array/</guid><description>轮转数组的解题思路与 C++ 实现。</description></item><item><title>岛屿数量</title><link>https://jiat-t.github.io/leetcode/graph/medium/number-of-islands/</link><pubDate>Sun, 12 Apr 2026 04:30:04 +0000</pubDate><guid>https://jiat-t.github.io/leetcode/graph/medium/number-of-islands/</guid><description>岛屿数量的解题思路与 C++ 实现。</description></item><item><title>除了自身以外数组的乘积</title><link>https://jiat-t.github.io/leetcode/array/medium/product-of-array-except-self/</link><pubDate>Tue, 21 Apr 2026 09:45:56 +0000</pubDate><guid>https://jiat-t.github.io/leetcode/array/medium/product-of-array-except-self/</guid><description>除了自身以外数组的乘积的解题思路与 C++ 实现。</description></item><item><title>滑动窗口最大值</title><link>https://jiat-t.github.io/leetcode/sliding-window/hard/leetcode-sliding-window-hard/</link><pubDate>Sat, 30 May 2026 02:42:58 +0000</pubDate><guid>https://jiat-t.github.io/leetcode/sliding-window/hard/leetcode-sliding-window-hard/</guid><description>滑动窗口最大值的解题思路与 C++ 实现。</description></item><item><title>移动零</title><link>https://jiat-t.github.io/leetcode/double-pointers/easy/move-zeroes/</link><pubDate>Sat, 11 Apr 2026 05:23:52 +0000</pubDate><guid>https://jiat-t.github.io/leetcode/double-pointers/easy/move-zeroes/</guid><description>移动零的解题思路与 C++ 实现。</description></item><item><title>字符串相加</title><link>https://jiat-t.github.io/leetcode/string/easy/leetcode-string-easy/</link><pubDate>Thu, 11 Jun 2026 03:16:27 +0000</pubDate><guid>https://jiat-t.github.io/leetcode/string/easy/leetcode-string-easy/</guid><description>字符串相加的解题思路与 C++ 实现。</description></item><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><item><title>腐烂的橘子</title><link>https://jiat-t.github.io/leetcode/graph/medium/rotting-oranges/</link><pubDate>Sun, 12 Apr 2026 04:30:04 +0000</pubDate><guid>https://jiat-t.github.io/leetcode/graph/medium/rotting-oranges/</guid><description>腐烂的橘子的解题思路与 C++ 实现。</description></item><item><title>回溯算法模板</title><link>https://jiat-t.github.io/leetcode/back-track/backtracking-overview/</link><pubDate>Sun, 26 Apr 2026 06:46:04 +0000</pubDate><guid>https://jiat-t.github.io/leetcode/back-track/backtracking-overview/</guid><description>记录回溯算法的结果集合、当前路径、终止条件以及撤销操作的 C++ 模板。</description></item></channel></rss>