Create Solution3.rs

Author: yanglbme

solution/0200-0299/0215.Kth Largest Element in an Array/Solution3.rs

@@ -0,0 +1,27 @@
+use std::collections::HashMap;
+
+impl Solution {
+    pub fn find_kth_largest(nums: Vec<i32>, k: i32) -> i32 {
+        let mut cnt = HashMap::new();
+        let mut m = i32::MIN;
+
+        for &x in &nums {
+            *cnt.entry(x).or_insert(0) += 1;
+            if x > m {
+                m = x;
+            }
+        }
+
+        let mut k = k;
+        for i in (i32::MIN..=m).rev() {
+            if let Some(&count) = cnt.get(&i) {
+                k -= count;
+                if k <= 0 {
+                    return i;
+                }
+            }
+        }
+
+        unreachable!();
+    }
+}