From 0a65939a47c5adb4008619667b497d69ecc94fe2 Mon Sep 17 00:00:00 2001
From: yanglbme <szuyanglb@outlook.com>
Date: Sun, 13 Jul 2025 07:56:34 +0800
Subject: [PATCH] feat: add rust solution to lc problem: No.2410

No.2410.Maximum Matching of Players With Trainers
---
 .../README.md                                 | 23 +++++++++++++++++++
 .../README_EN.md                              | 23 +++++++++++++++++++
 .../Solution.rs                               | 18 +++++++++++++++
 3 files changed, 64 insertions(+)
 create mode 100644 solution/2400-2499/2410.Maximum Matching of Players With Trainers/Solution.rs

diff --git a/solution/2400-2499/2410.Maximum Matching of Players With Trainers/README.md b/solution/2400-2499/2410.Maximum Matching of Players With Trainers/README.md
index cfb76752d6645..f595b49b4cf72 100644
--- a/solution/2400-2499/2410.Maximum Matching of Players With Trainers/README.md	
+++ b/solution/2400-2499/2410.Maximum Matching of Players With Trainers/README.md	
@@ -174,6 +174,29 @@ function matchPlayersAndTrainers(players: number[], trainers: number[]): number
 }
 ```
 
+#### Rust
+
+```rust
+impl Solution {
+    pub fn match_players_and_trainers(mut players: Vec<i32>, mut trainers: Vec<i32>) -> i32 {
+        players.sort();
+        trainers.sort();
+        let mut j = 0;
+        let n = trainers.len();
+        for (i, &p) in players.iter().enumerate() {
+            while j < n && trainers[j] < p {
+                j += 1;
+            }
+            if j == n {
+                return i as i32;
+            }
+            j += 1;
+        }
+        players.len() as i32
+    }
+}
+```
+
 <!-- tabs:end -->
 
 <!-- solution:end -->
diff --git a/solution/2400-2499/2410.Maximum Matching of Players With Trainers/README_EN.md b/solution/2400-2499/2410.Maximum Matching of Players With Trainers/README_EN.md
index 66393a74c65a7..b359f7d080bbb 100644
--- a/solution/2400-2499/2410.Maximum Matching of Players With Trainers/README_EN.md	
+++ b/solution/2400-2499/2410.Maximum Matching of Players With Trainers/README_EN.md	
@@ -177,6 +177,29 @@ function matchPlayersAndTrainers(players: number[], trainers: number[]): number
 }
 ```
 
+#### Rust
+
+```rust
+impl Solution {
+    pub fn match_players_and_trainers(mut players: Vec<i32>, mut trainers: Vec<i32>) -> i32 {
+        players.sort();
+        trainers.sort();
+        let mut j = 0;
+        let n = trainers.len();
+        for (i, &p) in players.iter().enumerate() {
+            while j < n && trainers[j] < p {
+                j += 1;
+            }
+            if j == n {
+                return i as i32;
+            }
+            j += 1;
+        }
+        players.len() as i32
+    }
+}
+```
+
 <!-- tabs:end -->
 
 <!-- solution:end -->
diff --git a/solution/2400-2499/2410.Maximum Matching of Players With Trainers/Solution.rs b/solution/2400-2499/2410.Maximum Matching of Players With Trainers/Solution.rs
new file mode 100644
index 0000000000000..2d2906e9effd2
--- /dev/null
+++ b/solution/2400-2499/2410.Maximum Matching of Players With Trainers/Solution.rs	
@@ -0,0 +1,18 @@
+impl Solution {
+    pub fn match_players_and_trainers(mut players: Vec<i32>, mut trainers: Vec<i32>) -> i32 {
+        players.sort();
+        trainers.sort();
+        let mut j = 0;
+        let n = trainers.len();
+        for (i, &p) in players.iter().enumerate() {
+            while j < n && trainers[j] < p {
+                j += 1;
+            }
+            if j == n {
+                return i as i32;
+            }
+            j += 1;
+        }
+        players.len() as i32
+    }
+}