- Question:
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.
- Analysis:
直接将数组进行排序后,返回第k大的数即可,但是时间复杂度比较高。
- Code:
class Solution { public: int findKthLargest(vector<int>& nums, int k) { sort(nums.begin(),nums.end()); reverse(nums.begin(),nums.end()); return nums[k-1]; } };