【LeetCode】 215. Kth Largest Element in an Array

最新推荐文章于 2023-12-15 19:39:48 发布

Juxin_Lin

最新推荐文章于 2023-12-15 19:39:48 发布

阅读量810

点赞数

分类专栏： leetcode 分治文章标签： leetcode 分治

本文链接：https://blog.csdn.net/Juxin_Lin/article/details/54234742

版权

leetcode 同时被 2 个专栏收录

39 篇文章 0 订阅

订阅专栏

分治

6 篇文章 0 订阅

订阅专栏

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.

class Solution {
public:
    int findKthLargest(vector<int>& nums, int k) {
        int length = nums.size();
        if (length == 1) {
            return nums[0];
        }
        vector<int> left;
        vector<int> right;
        
        for (int index=1; index<length; index++) {
            if (nums[index] > nums[0]) {
                right.push_back(nums[index]);
            }else{
                left.push_back(nums[index]);
            }
        }
        length = right.size();
        if (length >=k) {
            return findKthLargest(right, k);
        }else if(length == k-1){
            return nums[0];
        }else{
            return findKthLargest(left, k-length-1);
        }
    }
};