【leetcode】215. Kth Largest Element in an Array

关注

原创最新推荐文章于 2026-03-28 10:39:33 发布 162 阅读 AI 写同款· GEO 优化 ›

AI权益加码！Claude Code、Cursor等20+工具免费用！购周边限时加赠Coding Plan Lite，畅享主流AI工具！学习进阶更高效！阅读详情

215. Kth Largest Element in an Array

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.

Example 1:

Input: [3,2,1,5,6,4] and k = 2
Output: 5

Example 2:

Input: [3,2,3,1,2,4,5,5,6] and k = 4
Output: 4

Note:
You may assume k is always valid, 1 ≤ k ≤ array's length.

题目链接：https://leetcode.com/problems/kth-largest-element-in-an-array/

法：快排partition法

递归

class Solution {
public:
    int findKthLargest(vector<int>& nums, int k) {
        return sort(nums, 0 , nums.size()-1, k);
    }
    int sort(vector<int>& nums, int left, int right, int k){
        int l = left, r = right-1, pivilot = right, key = nums[pivilot];
        while(l<=r){
            while(nums[l] >= key && l<=r){
                l++;
            }
            if(l<=r){
                nums[pivilot] = nums[l];
                pivilot = l++;
            }
            while(nums[r] <= key && l<=r){
                r--;
            }
            if(l<=r){
                nums[pivilot] = nums[r];
                pivilot = r--;
            }
        }
        nums[pivilot] = key;
        if(pivilot > k-1){
            return sort(nums, left, pivilot-1, k);
        }
        else if(pivilot < k-1){
            return sort(nums, pivilot+1, right, k);
        } 
        else return key;
    }
};

非递归

class Solution {
public:
    int findKthLargest(vector<int>& nums, int k) {
        int l = 0, r=nums.size()-1;
        while(true){
            int p = partition(nums, l, r);
            if(p>k-1) r = p-1;
            else if(p<k-1) l = p+1;
            else return nums[p];
        }
    }
    int partition(vector<int>& nums, int left, int right){
        int l = left, r = right-1, pivilot = right, key = nums[pivilot];
        while(l<=r){
            while(nums[l] >= key && l<=r){
                l++;
            }
            if(l<=r){
                nums[pivilot] = nums[l];
                pivilot = l++;
            }
            while(nums[r] <= key && l<=r){
                r--;
            }
            if(l<=r){
                nums[pivilot] = nums[r];
                pivilot = r--;
            }
        }
        nums[pivilot] = key;
        return pivilot;
    }
};

法：堆

//TODO

法：

//TODO

六种解法：https://blog.csdn.net/zxzxzx0119/article/details/81509018

收录于