<?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>Merge Sort on LeetCode 题解笔记</title><link>https://leetcode-solutions-5zk.pages.dev/tags/merge-sort/</link><description>Recent content in Merge Sort 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/merge-sort/index.xml" rel="self" type="application/rss+xml"/><item><title>3737. 统计具有主要元素的子数组数量 I</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3737-count-subarrays-with-majority-element-i/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3737-count-subarrays-with-majority-element-i/</guid><description>Medium | Array, Hash Table, Divide and Conquer, Segment Tree, Merge Sort, Counting, Prefix Sum</description></item><item><title>3739. 计算多数元素子数组 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3739-count-subarrays-with-majority-element-ii/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3739-count-subarrays-with-majority-element-ii/</guid><description>Hard | Array, Hash Table, Divide and Conquer, Segment Tree, Merge Sort, Prefix Sum</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>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>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>912. 排序数组</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0912-sort-an-array/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0912-sort-an-array/</guid><description>Medium | Array, Divide and Conquer, Sorting, Heap (Priority Queue), Merge Sort, Bucket Sort, Radix Sort, Counting Sort</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>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>148. 排序链表</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0148-sort-list/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0148-sort-list/</guid><description>Medium | Linked List, Two Pointers, Divide and Conquer, Sorting, Merge Sort</description></item><item><title>23. 合并K个升序链表</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0023-merge-k-sorted-lists/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0023-merge-k-sorted-lists/</guid><description>Hard | Linked List, Divide and Conquer, Heap (Priority Queue), Merge Sort</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>