题目: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.
样例:
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.
这道题我用的是常规方法。先将数组从大到小进行排列,然后输出第k个数,也就是数组中的第k - 1个数。
提交代码:
class Solution {
public:
int findKthLargest(vector< int >& nums, int k) {
for(int i = 0; i < nums.size(); i++) {
for(int j = 0; j < nums.size() - 1; j++) {
if(nums[j] < nums[j + 1])
swap(nums[j], nums[j + 1]);
}
}
return nums[k - 1];
}
};
这种方法的时间复杂度为O(n^2),如果数组中的数字较多,时间会比较长。以下还摘抄了网上其他人的解法:
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);
}
}
};
这种方法极大的缩短了寻找的时间。不用每一次都从头开始遍历数组。或者直接调用sort进行排序,然后用reverse反转过来。
class Solution {
public:
int findKthLargest(vector< int >& nums, int k) {
sort(nums.begin(), nums.end());
reverse(nums.begin(), nums.end());
return nums[k-1];
}
};