feat: add rust solution to lc problem: No.0253 (doocs#1237)

Author: xzhseh

solution/0200-0299/0253.Meeting Rooms II/README.md

@@ -98,6 +98,48 @@ public:
 };
 ```
 
+### **Rust**
+
+```rust
+use std::{collections::BinaryHeap, cmp::Reverse};
+
+impl Solution {
+    #[allow(dead_code)]
+    pub fn min_meeting_rooms(intervals: Vec<Vec<i32>>) -> i32 {
+        // The min heap that stores the earliest ending time among all meeting rooms
+        let mut pq = BinaryHeap::new();
+        let mut intervals = intervals;
+        let n = intervals.len();
+
+        // Let's first sort the intervals vector
+        intervals.sort_by(|lhs, rhs| {
+            lhs[0].cmp(&rhs[0])
+        });
+
+        // Push the first end time to the heap
+        pq.push(Reverse(intervals[0][1]));
+
+        // Traverse the intervals vector
+        for i in 1..n {
+            // Get the current top element from the heap
+            if let Some(Reverse(end_time)) = pq.pop() {
+                if end_time <= intervals[i][0] {
+                    // If the end time is early than the current begin time
+                    let new_end_time = intervals[i][1];
+                    pq.push(Reverse(new_end_time));
+                } else {
+                    // Otherwise, push the end time back and we also need a new room
+                    pq.push(Reverse(end_time));
+                    pq.push(Reverse(intervals[i][1]));
+                }
+            }
+        }
+        
+        pq.len() as i32
+    }
+}
+```
+
 ### **Go**
 
 ```go

solution/0200-0299/0253.Meeting Rooms II/README_EN.md

@@ -79,6 +79,48 @@ public:
 };
 ```
 
+### **Rust**
+
+```rust
+use std::{collections::BinaryHeap, cmp::Reverse};
+
+impl Solution {
+    #[allow(dead_code)]
+    pub fn min_meeting_rooms(intervals: Vec<Vec<i32>>) -> i32 {
+        // The min heap that stores the earliest ending time among all meeting rooms
+        let mut pq = BinaryHeap::new();
+        let mut intervals = intervals;
+        let n = intervals.len();
+
+        // Let's first sort the intervals vector
+        intervals.sort_by(|lhs, rhs| {
+            lhs[0].cmp(&rhs[0])
+        });
+
+        // Push the first end time to the heap
+        pq.push(Reverse(intervals[0][1]));
+
+        // Traverse the intervals vector
+        for i in 1..n {
+            // Get the current top element from the heap
+            if let Some(Reverse(end_time)) = pq.pop() {
+                if end_time <= intervals[i][0] {
+                    // If the end time is early than the current begin time
+                    let new_end_time = intervals[i][1];
+                    pq.push(Reverse(new_end_time));
+                } else {
+                    // Otherwise, push the end time back and we also need a new room
+                    pq.push(Reverse(end_time));
+                    pq.push(Reverse(intervals[i][1]));
+                }
+            }
+        }
+        
+        pq.len() as i32
+    }
+}
+```
+
 ### **Go**
 
 ```go

solution/0200-0299/0253.Meeting Rooms II/Solution.rs

@@ -0,0 +1,37 @@
+use std::{collections::BinaryHeap, cmp::Reverse};
+
+impl Solution {
+    #[allow(dead_code)]
+    pub fn min_meeting_rooms(intervals: Vec<Vec<i32>>) -> i32 {
+        // The min heap that stores the earliest ending time among all meeting rooms
+        let mut pq = BinaryHeap::new();
+        let mut intervals = intervals;
+        let n = intervals.len();
+
+        // Let's first sort the intervals vector
+        intervals.sort_by(|lhs, rhs| {
+            lhs[0].cmp(&rhs[0])
+        });
+
+        // Push the first end time to the heap
+        pq.push(Reverse(intervals[0][1]));
+
+        // Traverse the intervals vector
+        for i in 1..n {
+            // Get the current top element from the heap
+            if let Some(Reverse(end_time)) = pq.pop() {
+                if end_time <= intervals[i][0] {
+                    // If the end time is early than the current begin time
+                    let new_end_time = intervals[i][1];
+                    pq.push(Reverse(new_end_time));
+                } else {
+                    // Otherwise, push the end time back and we also need a new room
+                    pq.push(Reverse(end_time));
+                    pq.push(Reverse(intervals[i][1]));
+                }
+            }
+        }
+        
+        pq.len() as i32
+    }
+}