<?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>Quickselect on LeetCode 题解笔记</title><link>https://leetcode-solutions-5zk.pages.dev/tags/quickselect/</link><description>Recent content in Quickselect 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/quickselect/index.xml" rel="self" type="application/rss+xml"/><item><title>973. K 个最接近原点的点</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0973-k-closest-points-to-origin/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0973-k-closest-points-to-origin/</guid><description>Medium | Array, Math, Divide and Conquer, Geometry, Sorting, Heap (Priority Queue), Quickselect</description></item><item><title>3759. 统计至少有 K 个更大值的元素</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3759-count-elements-with-at-least-k-greater-values/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3759-count-elements-with-at-least-k-greater-values/</guid><description>Medium | Array, Binary Search, Divide and Conquer, Sorting, Quickselect</description></item><item><title>2343. 查询第 K 小的裁剪数字</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2343-query-kth-smallest-trimmed-number/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2343-query-kth-smallest-trimmed-number/</guid><description>Medium | Array, String, Divide and Conquer, Sorting, Heap (Priority Queue), Radix Sort, Quickselect</description></item><item><title>1738. 找到第 K 大的异或坐标值</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1738-find-kth-largest-xor-coordinate-value/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1738-find-kth-largest-xor-coordinate-value/</guid><description>Medium | Array, Divide and Conquer, Bit Manipulation, Sorting, Heap (Priority Queue), Matrix, Prefix Sum, Quickselect</description></item><item><title>1985. 找到数组中第 K 大的整数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1985-find-the-kth-largest-integer-in-the-array/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1985-find-the-kth-largest-integer-in-the-array/</guid><description>Medium | Array, String, Divide and Conquer, Sorting, Heap (Priority Queue), Quickselect</description></item><item><title>324. 摆动排序 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0324-wiggle-sort-ii/</link><pubDate>Mon, 20 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0324-wiggle-sort-ii/</guid><description>Medium | Array, Divide and Conquer, Greedy, Sorting, Quickselect</description></item><item><title>347. 前 K 个高频元素</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0347-top-k-frequent-elements/</link><pubDate>Mon, 20 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0347-top-k-frequent-elements/</guid><description>Medium | Array, Hash Table, Divide and Conquer, Sorting, Heap (Priority Queue), Bucket Sort, Counting, Quickselect</description></item><item><title>215. 数组中的第K个最大元素</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0215-kth-largest-element-in-an-array/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0215-kth-largest-element-in-an-array/</guid><description>Medium | Array, Divide and Conquer, Sorting, Heap (Priority Queue), Quickselect</description></item></channel></rss>