20240720 Finished

This commit is contained in:
jackfiled 2024-07-20 11:42:37 +08:00
parent 942e8170b7
commit 26ffc40123
2 changed files with 39 additions and 1 deletions

View File

@ -179,3 +179,4 @@ mod p74_search_a_2d_matrix;
mod p33_search_in_rotated_sorted_array; mod p33_search_in_rotated_sorted_array;
mod p34_find_first_and_last_position_of_element_in_sorted_array; mod p34_find_first_and_last_position_of_element_in_sorted_array;
mod p153_find_minimum_in_rotated_sorted_array; mod p153_find_minimum_in_rotated_sorted_array;
mod p215_kth_largest_element_in_an_array;

View File

@ -0,0 +1,37 @@
/**
* [215] Kth Largest Element in an Array
*/
pub struct Solution {}
// submission codes start here
impl Solution {
pub fn find_kth_largest(nums: Vec<i32>, k: i32) -> i32 {
use std::{cmp::Reverse, collections::BinaryHeap};
let k = k as usize;
let mut heap = BinaryHeap::<Reverse<i32>>::with_capacity(k);
for i in nums {
if heap.len() == k && heap.peek().unwrap().0 < i {
heap.pop();
heap.push(Reverse(i));
} else if heap.len() < k {
heap.push(Reverse(i));
}
}
heap.pop().unwrap().0
}
}
// submission codes end
#[cfg(test)]
mod tests {
use super::*;
#[test]
fn test_215() {}
}