<?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>Ordered Set on LeetCode 题解笔记</title><link>https://leetcode-solutions-5zk.pages.dev/tags/ordered-set/</link><description>Recent content in Ordered Set on LeetCode 题解笔记</description><generator>Hugo</generator><language>zh-cn</language><copyright>2026 ZenzZwei</copyright><lastBuildDate>Mon, 11 May 2026 12:12:02 +0800</lastBuildDate><atom:link href="https://leetcode-solutions-5zk.pages.dev/tags/ordered-set/index.xml" rel="self" type="application/rss+xml"/><item><title>1675. 最小化数组偏差</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1675-minimize-deviation-in-array/</link><pubDate>Thu, 30 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1675-minimize-deviation-in-array/</guid><description>Hard | Array, Greedy, Heap (Priority Queue), Ordered Set</description></item><item><title>1438. 绝对差不超过限制的最长连续子数组</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1438-longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1438-longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit/</guid><description>Medium | Array, Queue, Sliding Window, Heap (Priority Queue), Ordered Set, Monotonic Queue</description></item><item><title>363. 矩形区域不超过 K 的最大数值和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0363-max-sum-of-rectangle-no-larger-than-k/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0363-max-sum-of-rectangle-no-larger-than-k/</guid><description>Hard | Array, Binary Search, Matrix, Prefix Sum, Ordered Set</description></item><item><title>3244. 道路修建查询后的最短距离 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3244-shortest-distance-after-road-addition-queries-ii/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3244-shortest-distance-after-road-addition-queries-ii/</guid><description>Hard | Array, Greedy, Graph Theory, Ordered Set</description></item><item><title>3245. 交替组 III</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3245-alternating-groups-iii/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3245-alternating-groups-iii/</guid><description>Hard | Array, Binary Indexed Tree, Ordered Set</description></item><item><title>3408. 设计任务管理器</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3408-design-task-manager/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3408-design-task-manager/</guid><description>Medium | Hash Table, Design, Heap (Priority Queue), Ordered Set</description></item><item><title>3477. 水果装篮 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3477-fruits-into-baskets-ii/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3477-fruits-into-baskets-ii/</guid><description>Easy | Array, Binary Search, Segment Tree, Simulation, Ordered Set</description></item><item><title>3479. 水果装篮 III</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3479-fruits-into-baskets-iii/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3479-fruits-into-baskets-iii/</guid><description>Medium | Array, Binary Search, Segment Tree, Ordered Set</description></item><item><title>3507. 最小配对移除操作使数组有序 I</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3507-minimum-pair-removal-to-sort-array-i/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3507-minimum-pair-removal-to-sort-array-i/</guid><description>Easy | Array, Hash Table, Linked List, Heap (Priority Queue), Simulation, Doubly-Linked List, Ordered Set</description></item><item><title>3508. 实现路由器</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3508-implement-router/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3508-implement-router/</guid><description>Medium | Array, Hash Table, Binary Search, Design, Queue, Ordered Set</description></item><item><title>3510. 最小配对移除使数组有序 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3510-minimum-pair-removal-to-sort-array-ii/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3510-minimum-pair-removal-to-sort-array-ii/</guid><description>Hard | Array, Hash Table, Linked List, Heap (Priority Queue), Simulation, Doubly-Linked List, Ordered Set</description></item><item><title>3590. 第K小路径异或和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3590-kth-smallest-path-xor-sum/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3590-kth-smallest-path-xor-sum/</guid><description>Hard | Array, Tree, Depth-First Search, Ordered Set</description></item><item><title>3607. 电网维护</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3607-power-grid-maintenance/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3607-power-grid-maintenance/</guid><description>Medium | Array, Hash Table, Depth-First Search, Breadth-First Search, Union-Find, Graph Theory, Heap (Priority Queue), Ordered Set</description></item><item><title>3666. 使二进制字符串相等的最少操作数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3666-minimum-operations-to-equalize-binary-string/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3666-minimum-operations-to-equalize-binary-string/</guid><description>Hard | Math, String, Breadth-First Search, Union-Find, Ordered Set</description></item><item><title>3815. 设计竞价系统</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3815-design-auction-system/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3815-design-auction-system/</guid><description>Medium | Hash Table, Design, Heap (Priority Queue), Ordered Set</description></item><item><title>3885. 设计事件管理器</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3885-design-event-manager/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3885-design-event-manager/</guid><description>Medium | Array, Hash Table, Design, Heap (Priority Queue), Ordered Set</description></item><item><title>3092. 最频繁的 IDs</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3092-most-frequent-ids/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3092-most-frequent-ids/</guid><description>Medium | Array, Hash Table, Heap (Priority Queue), Ordered Set</description></item><item><title>3102. 最小化曼哈顿距离</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3102-minimize-manhattan-distances/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3102-minimize-manhattan-distances/</guid><description>Hard | Array, Math, Geometry, Sorting, Ordered Set</description></item><item><title>2659. 数组清空</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2659-make-array-empty/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2659-make-array-empty/</guid><description>Hard | Array, Binary Search, Greedy, Binary Indexed Tree, Segment Tree, Sorting, Ordered Set</description></item><item><title>2713. 矩阵中严格递增路径的最大长度</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2713-maximum-strictly-increasing-cells-in-a-matrix/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2713-maximum-strictly-increasing-cells-in-a-matrix/</guid><description>Hard | Array, Hash Table, Binary Search, Dynamic Programming, Memoization, Sorting, Matrix, Ordered Set</description></item><item><title>2762. 连续子数组</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2762-continuous-subarrays/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2762-continuous-subarrays/</guid><description>Medium | Array, Queue, Sliding Window, Heap (Priority Queue), Ordered Set, Monotonic Queue</description></item><item><title>2817. 具有约束的元素间最小绝对差</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2817-minimum-absolute-difference-between-elements-with-constraint/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2817-minimum-absolute-difference-between-elements-with-constraint/</guid><description>Medium | Array, Binary Search, Ordered Set</description></item><item><title>2034. 股票价格波动</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2034-stock-price-fluctuation/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2034-stock-price-fluctuation/</guid><description>Medium | Hash Table, Design, Heap (Priority Queue), Data Stream, Ordered Set</description></item><item><title>2035. 将数组分割成两个数组以最小化和差</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2035-partition-array-into-two-arrays-to-minimize-sum-difference/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2035-partition-array-into-two-arrays-to-minimize-sum-difference/</guid><description>Hard | Array, Two Pointers, Binary Search, Dynamic Programming, Bit Manipulation, Sorting, Ordered Set, Bitmask</description></item><item><title>2102. 序列序数排名跟踪器</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2102-sequentially-ordinal-rank-tracker/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2102-sequentially-ordinal-rank-tracker/</guid><description>Hard | Design, Heap (Priority Queue), Data Stream, Ordered Set</description></item><item><title>2179. 统计数组中的好三元组</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2179-count-good-triplets-in-an-array/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2179-count-good-triplets-in-an-array/</guid><description>Hard | Array, Binary Search, Divide and Conquer, Binary Indexed Tree, Segment Tree, Merge Sort, Ordered Set</description></item><item><title>2213. 单一重复字符的最长子串</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2213-longest-substring-of-one-repeating-character/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2213-longest-substring-of-one-repeating-character/</guid><description>Hard | Array, String, Segment Tree, Ordered Set</description></item><item><title>2251. 盛开花朵的数量</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2251-number-of-flowers-in-full-bloom/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2251-number-of-flowers-in-full-bloom/</guid><description>Hard | Array, Hash Table, Binary Search, Sorting, Prefix Sum, Ordered Set</description></item><item><title>2276. 区间内整数统计</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2276-count-integers-in-intervals/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2276-count-integers-in-intervals/</guid><description>Hard | Design, Segment Tree, Ordered Set</description></item><item><title>2336. 无限集中的最小数字</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2336-smallest-number-in-infinite-set/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2336-smallest-number-in-infinite-set/</guid><description>Medium | Hash Table, Design, Heap (Priority Queue), Ordered Set</description></item><item><title>2349. 设计数字容器系统</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2349-design-a-number-container-system/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2349-design-a-number-container-system/</guid><description>Medium | Hash Table, Design, Heap (Priority Queue), Ordered Set</description></item><item><title>2353. 设计食物评分系统</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2353-design-a-food-rating-system/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2353-design-a-food-rating-system/</guid><description>Medium | Array, Hash Table, String, Design, Heap (Priority Queue), Ordered Set</description></item><item><title>2363. 合并相似的物品</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2363-merge-similar-items/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2363-merge-similar-items/</guid><description>Easy | Array, Hash Table, Sorting, Ordered Set</description></item><item><title>2382. 删除后的最大线段和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2382-maximum-segment-sum-after-removals/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2382-maximum-segment-sum-after-removals/</guid><description>Hard | Array, Union-Find, Prefix Sum, Ordered Set</description></item><item><title>2424. 最长上传前缀</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2424-longest-uploaded-prefix/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2424-longest-uploaded-prefix/</guid><description>Medium | Hash Table, Binary Search, Union-Find, Design, Binary Indexed Tree, Segment Tree, Heap (Priority Queue), Ordered Set</description></item><item><title>2426. 满足不等式的数对数目</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2426-number-of-pairs-satisfying-inequality/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2426-number-of-pairs-satisfying-inequality/</guid><description>Hard | Array, Binary Search, Divide and Conquer, Binary Indexed Tree, Segment Tree, Merge Sort, Ordered Set</description></item><item><title>2612. 最小反转操作数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2612-minimum-reverse-operations/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2612-minimum-reverse-operations/</guid><description>Hard | Array, Hash Table, Breadth-First Search, Union-Find, Ordered Set</description></item><item><title>1348. 推文计数器（按频率统计）</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1348-tweet-counts-per-frequency/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1348-tweet-counts-per-frequency/</guid><description>Medium | Hash Table, String, Binary Search, Design, Sorting, Ordered Set</description></item><item><title>1418. 餐厅食物订单显示表</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1418-display-table-of-food-orders-in-a-restaurant/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1418-display-table-of-food-orders-in-a-restaurant/</guid><description>Medium | Array, Hash Table, String, Sorting, Ordered Set</description></item><item><title>1606. 找到处理最多请求数的服务器</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1606-find-servers-that-handled-most-number-of-requests/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1606-find-servers-that-handled-most-number-of-requests/</guid><description>Hard | Array, Heap (Priority Queue), Simulation, Ordered Set</description></item><item><title>1649. 通过指令创建有序数组</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1649-create-sorted-array-through-instructions/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1649-create-sorted-array-through-instructions/</guid><description>Hard | Array, Binary Search, Divide and Conquer, Binary Indexed Tree, Segment Tree, Merge Sort, Ordered Set</description></item><item><title>1818. 最小绝对和差</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1818-minimum-absolute-sum-difference/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1818-minimum-absolute-sum-difference/</guid><description>Medium | Array, Binary Search, Sorting, Ordered Set</description></item><item><title>1825. 找到 MK 平均值</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1825-finding-mk-average/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1825-finding-mk-average/</guid><description>Hard | Design, Queue, Heap (Priority Queue), Data Stream, Ordered Set</description></item><item><title>1847. 最近的房间</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1847-closest-room/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1847-closest-room/</guid><description>Hard | Array, Binary Search, Sorting, Ordered Set</description></item><item><title>1912. 设计电影租赁系统</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1912-design-movie-rental-system/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1912-design-movie-rental-system/</guid><description>Hard | Array, Hash Table, Design, Heap (Priority Queue), Ordered Set</description></item><item><title>729. 我的日程安排表 I</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0729-my-calendar-i/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0729-my-calendar-i/</guid><description>Medium | Array, Binary Search, Design, Segment Tree, Ordered Set</description></item><item><title>731. 我的日程安排表 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0731-my-calendar-ii/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0731-my-calendar-ii/</guid><description>Medium | Array, Binary Search, Design, Segment Tree, Prefix Sum, Ordered Set</description></item><item><title>732. 我的日程安排表 III</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0732-my-calendar-iii/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0732-my-calendar-iii/</guid><description>Hard | Binary Search, Design, Segment Tree, Prefix Sum, Ordered Set</description></item><item><title>850. 矩形面积 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0850-rectangle-area-ii/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0850-rectangle-area-ii/</guid><description>Hard | Array, Segment Tree, Sweep Line, Ordered Set</description></item><item><title>855. 考试房间</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0855-exam-room/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0855-exam-room/</guid><description>Medium | Design, Heap (Priority Queue), Ordered Set</description></item><item><title>895. 最大频率栈</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0895-maximum-frequency-stack/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0895-maximum-frequency-stack/</guid><description>Hard | Hash Table, Stack, Design, Ordered Set</description></item><item><title>975. 奇偶跳</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0975-odd-even-jump/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0975-odd-even-jump/</guid><description>Hard | Array, Dynamic Programming, Stack, Sorting, Monotonic Stack, Ordered Set</description></item><item><title>493. 翻转对</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0493-reverse-pairs/</link><pubDate>Tue, 21 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0493-reverse-pairs/</guid><description>Hard | Array, Binary Search, Divide and Conquer, Binary Indexed Tree, Segment Tree, Merge Sort, Ordered Set</description></item><item><title>497. 非重叠矩形中的随机点</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0497-random-point-in-non-overlapping-rectangles/</link><pubDate>Tue, 21 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0497-random-point-in-non-overlapping-rectangles/</guid><description>Medium | Array, Math, Binary Search, Reservoir Sampling, Prefix Sum, Ordered Set, Randomized</description></item><item><title>699. 下降方块</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0699-falling-squares/</link><pubDate>Tue, 21 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0699-falling-squares/</guid><description>Hard | Array, Segment Tree, Ordered Set</description></item><item><title>715. 区间模块</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0715-range-module/</link><pubDate>Tue, 21 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0715-range-module/</guid><description>Hard | Design, Segment Tree, Ordered Set</description></item><item><title>327. 区间和的个数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0327-count-of-range-sum/</link><pubDate>Mon, 20 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0327-count-of-range-sum/</guid><description>Hard | Array, Binary Search, Divide and Conquer, Binary Indexed Tree, Segment Tree, Merge Sort, Ordered Set</description></item><item><title>352. 数据流的不相交区间</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0352-data-stream-as-disjoint-intervals/</link><pubDate>Mon, 20 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0352-data-stream-as-disjoint-intervals/</guid><description>Hard | Hash Table, Binary Search, Union-Find, Design, Data Stream, Ordered Set</description></item><item><title>456. 132 模式</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0456-132-pattern/</link><pubDate>Mon, 20 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0456-132-pattern/</guid><description>Medium | Array, Binary Search, Stack, Monotonic Stack, Ordered Set</description></item><item><title>218. 天际线问题</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0218-the-skyline-problem/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0218-the-skyline-problem/</guid><description>Hard | Array, Divide and Conquer, Binary Indexed Tree, Segment Tree, Sweep Line, Sorting, Heap (Priority Queue), Ordered Set</description></item><item><title>220. 存在重复元素 III</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0220-contains-duplicate-iii/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0220-contains-duplicate-iii/</guid><description>Hard | Array, Sliding Window, Sorting, Bucket Sort, Ordered Set</description></item><item><title>315. 计算右侧小于当前元素的个数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0315-count-of-smaller-numbers-after-self/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0315-count-of-smaller-numbers-after-self/</guid><description>Hard | Array, Binary Search, Divide and Conquer, Binary Indexed Tree, Segment Tree, Merge Sort, Ordered Set</description></item></channel></rss>