【leetcode】215. Kth Largest Element in an Array

最新推荐文章于 2022-09-17 18:00:30 发布

原创最新推荐文章于 2022-09-17 18:00:30 发布 · 157 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

code 专栏收录该内容

233 篇文章

订阅专栏

本文详细解析了LeetCode上Kth Largest Element in an Array问题的两种解决方案：使用快速排序的partition方法和堆排序。通过递归和非递归方式实现快速排序，并附带详细的代码示例，帮助读者理解如何找到未排序数组中第k大的元素。

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