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.
Credits:
Special thanks to @mithmatt for adding this problem and creating all test cases.
class Solution {
public:
int findKthLargest(vector<int>& nums, int k) {
int * arr = new int[nums.size()];
int index =0 ;
for (vector<int>::iterator it = nums.begin();
it != nums.end(); it++) {
arr[index] = *it;
index++;
}
sort(arr, arr + nums.size());
index = nums.size();
int temp = arr[nums.size() - k];
delete arr;
return temp;
}
};
关于这道题目基本的做法都是将数组排序之后再直接将第K大的数字输出的。时间复杂度就是排序的时间复杂度O(nlogn)