215. Kth Largest Element in an Array
Posted dysjtu1995
tags:
篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了215. Kth Largest Element in an Array相关的知识,希望对你有一定的参考价值。
Problem:
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.
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
Note:
You may assume k is always valid, 1 ≤ k ≤ array‘s length.
思路:
Solution (C++):
int findKthLargest(vector<int>& nums, int k) {
int n = nums.size();
sort(nums.begin(), nums.end());
return nums[n-k];
}
性能:
Runtime: 8 ms??Memory Usage: 6.8 MB
思路:
Solution (C++):
性能:
Runtime: ms??Memory Usage: MB
以上是关于215. Kth Largest Element in an Array的主要内容,如果未能解决你的问题,请参考以下文章
Leetcode-215. Kth Largest Element in an Array
#Leetcode# 215. Kth Largest Element in an Array
LeetCode OJ 215. Kth Largest Element in an Array 堆排序求解
LN : leetcode 215 Kth Largest Element in an Array