LeetCode 215. Kth Largest Element in an Array

最新推荐文章于 2025-04-26 10:13:56 发布

develbai

最新推荐文章于 2025-04-26 10:13:56 发布

阅读量626

点赞数

分类专栏： LeetCode 文章标签： LeetCode Algorithm

本文链接：https://blog.csdn.net/master5512/article/details/79079747

版权

LeetCode 专栏收录该内容

21 篇文章

订阅专栏

本文介绍了解决LeetCode 215题“数组中的第K个最大元素”的快速选择算法。该算法通过一次遍历找到第K大的元素，并达到平均线性的时间复杂度。文中提供了一个Java实现示例。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

LeetCode 215. Kth Largest Element in an Array

Description

Find the kth largest element in an unsorted array. Note that it is the kth largest element in the sorted order, not the kth distinct element.

For example,
Given [3,2,1,5,6,4] and k = 2, return 5.

Note:

You may assume k is always valid, 1 ≤ k ≤ array’s length.


    public class Solution {
        public int findKthLargest(int[] nums, int k) {
            int index = quickSelect(nums, 0, nums.length-1, k-1);
            return nums[index];
        }

        private int quickSelect(int[] nums, int lo, int hi, int k) {
            int lt = lo;
            int gt = hi + 1;
            int i = lo + 1;
            int pivot = nums[lo];

            while (i < gt) {
                if (nums[i] > pivot) {
                    swap(nums, i, lt + 1);
                    lt++;
                    i++;
                }
                else if (nums[i] < pivot) {
                    swap(nums, i, gt - 1);
                    gt--;
                }
                else {
                    i++;
                }
            }

            swap(nums, lo, lt);

            if (lt == k) {
                return lt;
            }
            else if (lt < k) {
                return quickSelect(nums, lt + 1, hi, k);
            }
            else {
                return quickSelect(nums, lo, lt - 1, k);
            }
        }


        private void swap(int[] a, int i, int j) {
            int temp = a[i];
            a[i] = a[j];
            a[j] = temp;
        }
    }