大根堆解法:
时间复杂度O(K*lgN),空间复杂度O(K)
class Solution {
public:
int findKthLargest(vector<int>& nums, int k) {
priority_queue<int> q;
//将所有元素加入大根堆
for (int i = 0; i < nums.size(); ++i) {
q.push(nums
大根堆解法:
时间复杂度O(K*lgN),空间复杂度O(K)
class Solution {
public:
int findKthLargest(vector<int>& nums, int k) {
priority_queue<int> q;
//将所有元素加入大根堆
for (int i = 0; i < nums.size(); ++i) {
q.push(nums