<?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>Array on Hex4C59's Blog</title><link>http://hex4c59.cc/tags/array/</link><description>Recent content in Array on Hex4C59's Blog</description><generator>Hugo -- 0.150.0</generator><language>zh-cn</language><lastBuildDate>Wed, 25 Mar 2026 17:10:21 +0800</lastBuildDate><atom:link href="http://hex4c59.cc/tags/array/index.xml" rel="self" type="application/rss+xml"/><item><title>2779. 数组的最大美丽值</title><link>http://hex4c59.cc/leetcode/2779-maximum-beauty-of-an-array-after-applying-operation/</link><pubDate>Wed, 25 Mar 2026 12:00:00 +0800</pubDate><guid>http://hex4c59.cc/leetcode/2779-maximum-beauty-of-an-array-after-applying-operation/</guid><description>LeetCode 2779 数组的最大美丽值题解，排序后转化为不定长滑动窗口问题，寻找最长的合法区间。</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>