#Leetcode# 215. Kth Largest Element in an Array
Posted 丧心病狂工科女
tags:
篇首语：本文由小常识网(cha138.com)小编为大家整理，主要介绍了#Leetcode# 215. Kth Largest Element in an Array相关的知识，希望对你有一定的参考价值。
https://leetcode.com/problems/kth-largest-element-in-an-array/
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.
代码：
class Solution {
public:
int findKthLargest(vector<int>& nums, int k) {
int n = nums.size();
int ans;
sort(nums.begin(), nums.end());
ans = nums[n - k];
return ans;
}
};
FHFHFH
以上是关于#Leetcode# 215. Kth Largest Element in an Array的主要内容，如果未能解决你的问题，请参考以下文章
#Leetcode# 215. Kth Largest Element in an Array
LN : leetcode 215 Kth Largest Element in an Array
[LeetCode] 215. Kth Largest Element in an Array
leetcode 215. Kth Largest Element in an Array