215. Kth Largest Element in an Array - medium
문제
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.
제한사항
- You may assume k is always valid, 1 ≤ k ≤ array’s length.
입출력 예
1
2
3
4
5
6
7
Example 1:
Input: [3,2,1,5,6,4] and k = 2
Output: 5
Example 2:
Input: [3,2,3,1,2,4,5,5,6] and k = 4
Output: 4
풀이
- Divide and Conquer, Heap, Sort
1
2
3
4
5
6
7
8
9
class Solution {
public:
int findKthLargest(vector<int>& nums, int k) {
sort(nums.begin(), nums.end(), greater<int>());
return nums[k - 1];
}
};