Difficulty:Medium
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.
Solution
思路
该算法不需要将数组进行排序,是类似于divide and conquer的算法。算法如下:
①从数组nums中随意选一个数,称其为midNum,将midNum与nums中的其他数进行比较,比midNum小的数放入min数组,其他的放入max数组;
②若max.size() >= k
(说明第k大的数在max数组中),从max中挑一个数,赋值给midNum,将max复制到nums中,清空max和min,跳回步骤①;
③若max.size() == k - 1
,说明midNum就是第k大的数,结束;
④若max.size() < k - 1
,说明第k大的数在min数组中。从min里挑一个数赋值给midNum,令k = k - max.size() - 1
,将min复制到nums中,清空max和min,跳回步骤①;
代码
通过了leetcode检测,但它似乎对时间限制的要求不高,用把整个数组排好序的方法也能通过。
class Solution {
public:
int findKthLargest(vector<int>& nums, int k) {
int len = nums.size();
int midNum = nums[len / 2]; // 从数组中随机抽取一个数midNum;
vector<int> min, max; // 数组其余的数比midNum小的归入min数组,其余的归入max数组
while (true) {
for (int i = 0; i < nums.size(); ++i) {
if (i == len / 2) continue;
if (nums[i] < midNum) min.push_back(nums[i]);
else max.push_back(nums[i]);
}
if (max.size() >= k) {
len = max.size();
midNum = max[len / 2];
nums.assign(max.begin(), max.end());
}
else if (max.size() == k - 1) {
return midNum;
}
else {
len = min.size();
midNum = min[len / 2];
k = k - max.size() - 1;
nums.assign(min.begin(), min.end());
}
max.clear();
min.clear();
}
}
};