feat: add rust solution to lc problem: No.0362 (#1254)

Author: xzhseh

solution/0300-0399/0362.Design Hit Counter/README.md

@@ -95,6 +95,41 @@ class HitCounter:
 # param_2 = obj.getHits(timestamp)
 ```
 
+### **Rust**
+
+```rust
+use std::{collections::BinaryHeap, cmp::Reverse};
+
+struct HitCounter {
+    /// A min heap
+    pq: BinaryHeap<Reverse<i32>>,
+}
+
+impl HitCounter {
+    fn new() -> Self {
+        Self {
+            pq: BinaryHeap::new(),
+        }
+    }
+
+    fn hit(&mut self, timestamp: i32) {
+        self.pq.push(Reverse(timestamp));
+    }
+
+    fn get_hits(&mut self, timestamp: i32) -> i32 {
+        while let Some(Reverse(min_elem)) = self.pq.peek() {
+            if *min_elem <= timestamp - 300 {
+                self.pq.pop();
+            } else {
+                break;
+            }
+        }
+
+        self.pq.len() as i32
+    }
+}
+```
+
 ### **Java**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->

solution/0300-0399/0362.Design Hit Counter/README_EN.md

@@ -84,6 +84,41 @@ class HitCounter:
 # param_2 = obj.getHits(timestamp)
 ```
 
+### **Rust**
+
+```rust
+use std::{collections::BinaryHeap, cmp::Reverse};
+
+struct HitCounter {
+    /// A min heap
+    pq: BinaryHeap<Reverse<i32>>,
+}
+
+impl HitCounter {
+    fn new() -> Self {
+        Self {
+            pq: BinaryHeap::new(),
+        }
+    }
+
+    fn hit(&mut self, timestamp: i32) {
+        self.pq.push(Reverse(timestamp));
+    }
+
+    fn get_hits(&mut self, timestamp: i32) -> i32 {
+        while let Some(Reverse(min_elem)) = self.pq.peek() {
+            if *min_elem <= timestamp - 300 {
+                self.pq.pop();
+            } else {
+                break;
+            }
+        }
+
+        self.pq.len() as i32
+    }
+}
+```
+
 ### **Java**
 
 ```java

solution/0300-0399/0362.Design Hit Counter/Solution.rs

@@ -0,0 +1,30 @@
+use std::{collections::BinaryHeap, cmp::Reverse};
+
+struct HitCounter {
+    /// A min heap
+    pq: BinaryHeap<Reverse<i32>>,
+}
+
+impl HitCounter {
+    fn new() -> Self {
+        Self {
+            pq: BinaryHeap::new(),
+        }
+    }
+
+    fn hit(&mut self, timestamp: i32) {
+        self.pq.push(Reverse(timestamp));
+    }
+
+    fn get_hits(&mut self, timestamp: i32) -> i32 {
+        while let Some(Reverse(min_elem)) = self.pq.peek() {
+            if *min_elem <= timestamp - 300 {
+                self.pq.pop();
+            } else {
+                break;
+            }
+        }
+
+        self.pq.len() as i32
+    }
+}