2410. Maximum Matching of Players With Trainers: AC

Author: tan-wei

src/solution/mod.rs

@@ -1826,3 +1826,4 @@ mod s2405_optimal_partition_of_string;
 mod s2406_divide_intervals_into_minimum_number_of_groups;
 mod s2407_longest_increasing_subsequence_ii;
 mod s2409_count_days_spent_together;
+mod s2410_maximum_matching_of_players_with_trainers;

src/solution/s2410_maximum_matching_of_players_with_trainers.rs

@@ -0,0 +1,87 @@
+/**
+ * [2410] Maximum Matching of Players With Trainers
+ *
+ * You are given a 0-indexed integer array players, where players[i] represents the ability of the i^th player. You are also given a 0-indexed integer array trainers, where trainers[j] represents the training capacity of the j^th trainer.
+ * The i^th player can match with the j^th trainer if the player's ability is less than or equal to the trainer's training capacity. Additionally, the i^th player can be matched with at most one trainer, and the j^th trainer can be matched with at most one player.
+ * Return the maximum number of matchings between players and trainers that satisfy these conditions.
+ *  
+ * Example 1:
+ *
+ * Input: players = [4,7,9], trainers = [8,2,5,8]
+ * Output: 2
+ * Explanation:
+ * One of the ways we can form two matchings is as follows:
+ * - players[0] can be matched with trainers[0] since 4 <= 8.
+ * - players[1] can be matched with trainers[3] since 7 <= 8.
+ * It can be proven that 2 is the maximum number of matchings that can be formed.
+ *
+ * Example 2:
+ *
+ * Input: players = [1,1,1], trainers = [10]
+ * Output: 1
+ * Explanation:
+ * The trainer can be matched with any of the 3 players.
+ * Each player can only be matched with one trainer, so the maximum answer is 1.
+ *
+ *  
+ * Constraints:
+ *
+ * 	1 <= players.length, trainers.length <= 10^5
+ * 	1 <= players[i], trainers[j] <= 10^9
+ *
+ *  
+ * Note: This question is the same as <a href="https://leetcode.com/problems/assign-cookies/description/" target="_blank"> 445: Assign Cookies.</a>
+ *
+ */
+pub struct Solution {}
+
+// problem: https://leetcode.com/problems/maximum-matching-of-players-with-trainers/
+// discuss: https://leetcode.com/problems/maximum-matching-of-players-with-trainers/discuss/?currentPage=1&orderBy=most_votes&query=
+
+// submission codes start here
+
+impl Solution {
+    pub fn match_players_and_trainers(players: Vec<i32>, trainers: Vec<i32>) -> i32 {
+        let mut players = players;
+        let mut trainers = trainers;
+        players.sort_unstable();
+        trainers.sort_unstable();
+        players
+            .into_iter()
+            .scan(trainers.into_iter(), |t, p| t.find(|&t| p <= t))
+            .count() as _
+    }
+}
+
+// submission codes end
+
+#[cfg(test)]
+mod tests {
+    use super::*;
+
+    #[test]
+    fn test_2410_example_1() {
+        let players = vec![4, 7, 9];
+        let trainers = vec![8, 2, 5, 8];
+
+        let result = 2;
+
+        assert_eq!(
+            Solution::match_players_and_trainers(players, trainers),
+            result
+        );
+    }
+
+    #[test]
+    fn test_2410_example_2() {
+        let players = vec![1, 1, 1];
+        let trainers = vec![10];
+
+        let result = 1;
+
+        assert_eq!(
+            Solution::match_players_and_trainers(players, trainers),
+            result
+        );
+    }
+}