test: [20250713] Add (2410)

Author: actions-user

Cargo.toml

@@ -254,6 +254,7 @@ members = [
 	"problems/problems_3440",
 	"problems/problems_3169",
 	"problems/problems_1900",
+	"problems/problems_2410",
 ]
 
 [package]
@@ -530,3 +531,4 @@ solution_3439 = { path = "problems/problems_3439", features = ["solution_3439"]
 solution_3440 = { path = "problems/problems_3440", features = ["solution_3440"] }
 solution_3169 = { path = "problems/problems_3169", features = ["solution_3169"] }
 solution_1900 = { path = "problems/problems_1900", features = ["solution_1900"] }
+solution_2410 = { path = "problems/problems_2410", features = ["solution_2410"] }

daily-problems.json

@@ -1,4 +1,4 @@
 {
-    "daily": "1592",
+    "daily": "2410",
     "plans": ["3602", "problems", "3603", "problems", "3604", "problems", "3605", "problems", "3606", "problems", "3607", "problems", "3608", "problems", "3609", "problems"]
 }

golang/solution_test.go

@@ -1,10 +1,10 @@
 package golang
 
 import (
-	problem "leetCode/problems/problems_1592"
+	problem "leetCode/problems/problems_2410"
 	"testing"
 )
 
 func TestSolution(t *testing.T) {
-	TestEach(t, "1592", "problems", problem.Solve)
+	TestEach(t, "2410", "problems", problem.Solve)
 }

problems/problems_2410/Cargo.toml

@@ -0,0 +1,21 @@
+[package]
+name = "solution_2410"
+version = "0.1.0"
+edition = "2021"
+rust-version = "1.79.0"
+authors = ["benhao"]
+description = "LeetCode Solution 2410 in Rust"
+readme = "../../README.md"
+
+[features]
+solution_2410 = []
+
+[dependencies]
+serde_json = "1.0"
+rand = "0.8.4"
+regex = "1.10.5"
+library = { path = "../../rust/library", features = ["model"] }
+
+[lib]
+name = "solution_2410"
+path = "solution.rs"

problems/problems_2410/Solution.cpp

@@ -0,0 +1,29 @@
+//go:build ignore
+#include "cpp/common/Solution.h"
+
+
+using namespace std;
+using json = nlohmann::json;
+
+class Solution {
+public:
+    int matchPlayersAndTrainers(vector<int>& players, vector<int>& trainers) {
+        
+    }
+};
+
+json leetcode::qubh::Solve(string input_json_values) {
+	vector<string> inputArray;
+	size_t pos = input_json_values.find('\n');
+	while (pos != string::npos) {
+		inputArray.push_back(input_json_values.substr(0, pos));
+		input_json_values = input_json_values.substr(pos + 1);
+		pos = input_json_values.find('\n');
+	}
+	inputArray.push_back(input_json_values);
+
+	Solution solution;
+	vector<int> players = json::parse(inputArray.at(0));
+	vector<int> trainers = json::parse(inputArray.at(1));
+	return solution.matchPlayersAndTrainers(players, trainers);
+}

problems/problems_2410/Solution.java

@@ -0,0 +1,19 @@
+package problems.problems_2410;
+
+import com.alibaba.fastjson.JSON;
+import java.util.*;
+import qubhjava.BaseSolution;
+
+
+public class Solution extends BaseSolution {
+    public int matchPlayersAndTrainers(int[] players, int[] trainers) {
+        
+    }
+
+    @Override
+    public Object solve(String[] inputJsonValues) {
+        int[] players = jsonArrayToIntArray(inputJsonValues[0]);
+		int[] trainers = jsonArrayToIntArray(inputJsonValues[1]);
+        return JSON.toJSON(matchPlayersAndTrainers(players, trainers));
+    }
+}

problems/problems_2410/problem.md

@@ -0,0 +1,41 @@
+# 2410. Maximum Matching of Players With Trainers [Rating: 1381.09]
+
+<p>You are given a <strong>0-indexed</strong> integer array <code>players</code>, where <code>players[i]</code> represents the <strong>ability</strong> of the <code>i<sup>th</sup></code> player. You are also given a <strong>0-indexed</strong> integer array <code>trainers</code>, where <code>trainers[j]</code> represents the <strong>training capacity </strong>of the <code>j<sup>th</sup></code> trainer.</p>
+
+<p>The <code>i<sup>th</sup></code> player can <strong>match</strong> with the <code>j<sup>th</sup></code> trainer if the player&#39;s ability is <strong>less than or equal to</strong> the trainer&#39;s training capacity. Additionally, the <code>i<sup>th</sup></code> player can be matched with at most one trainer, and the <code>j<sup>th</sup></code> trainer can be matched with at most one player.</p>
+
+<p>Return <em>the <strong>maximum</strong> number of matchings between </em><code>players</code><em> and </em><code>trainers</code><em> that satisfy these conditions.</em></p>
+
+<p>&nbsp;</p>
+<p><strong class="example">Example 1:</strong></p>
+
+<pre>
+<strong>Input:</strong> players = [4,7,9], trainers = [8,2,5,8]
+<strong>Output:</strong> 2
+<strong>Explanation:</strong>
+One of the ways we can form two matchings is as follows:
+- players[0] can be matched with trainers[0] since 4 &lt;= 8.
+- players[1] can be matched with trainers[3] since 7 &lt;= 8.
+It can be proven that 2 is the maximum number of matchings that can be formed.
+</pre>
+
+<p><strong class="example">Example 2:</strong></p>
+
+<pre>
+<strong>Input:</strong> players = [1,1,1], trainers = [10]
+<strong>Output:</strong> 1
+<strong>Explanation:</strong>
+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.
+</pre>
+
+<p>&nbsp;</p>
+<p><strong>Constraints:</strong></p>
+
+<ul>
+	<li><code>1 &lt;= players.length, trainers.length &lt;= 10<sup>5</sup></code></li>
+	<li><code>1 &lt;= players[i], trainers[j] &lt;= 10<sup>9</sup></code></li>
+</ul>
+
+<p>&nbsp;</p>
+<p><strong>Note:</strong> This question is the same as <a href="https://leetcode.com/problems/assign-cookies/description/" target="_blank"> 445: Assign Cookies.</a></p>

problems/problems_2410/problem_zh.md

@@ -0,0 +1,38 @@
+# 2410. 运动员和训练师的最大匹配数 [难度分: 1381.09]
+
+<p>给你一个下标从 <strong>0</strong>&nbsp;开始的整数数组&nbsp;<code>players</code>&nbsp;，其中&nbsp;<code>players[i]</code>&nbsp;表示第 <code>i</code>&nbsp;名运动员的 <strong>能力</strong>&nbsp;值，同时给你一个下标从 <strong>0</strong>&nbsp;开始的整数数组&nbsp;<code>trainers</code>&nbsp;，其中&nbsp;<code>trainers[j]</code>&nbsp;表示第 <code>j</code>&nbsp;名训练师的 <strong>训练能力值</strong>&nbsp;。</p>
+
+<p>如果第 <code>i</code>&nbsp;名运动员的能力值 <strong>小于等于</strong>&nbsp;第 <code>j</code>&nbsp;名训练师的能力值，那么第&nbsp;<code>i</code>&nbsp;名运动员可以 <strong>匹配</strong>&nbsp;第&nbsp;<code>j</code>&nbsp;名训练师。除此以外，每名运动员至多可以匹配一位训练师，每位训练师最多可以匹配一位运动员。</p>
+
+<p>请你返回满足上述要求&nbsp;<code>players</code>&nbsp;和 <code>trainers</code>&nbsp;的 <strong>最大</strong> 匹配数。</p>
+
+<p>&nbsp;</p>
+
+<p><strong>示例 1：</strong></p>
+
+<pre><strong>输入：</strong>players = [4,7,9], trainers = [8,2,5,8]
+<b>输出：</b>2
+<b>解释：</b>
+得到两个匹配的一种方案是：
+- players[0] 与 trainers[0] 匹配，因为 4 &lt;= 8 。
+- players[1] 与 trainers[3] 匹配，因为 7 &lt;= 8 。
+可以证明 2 是可以形成的最大匹配数。
+</pre>
+
+<p><strong>示例 2：</strong></p>
+
+<pre><b>输入：</b>players = [1,1,1], trainers = [10]
+<b>输出：</b>1
+<b>解释：</b>
+训练师可以匹配所有 3 个运动员
+每个运动员至多只能匹配一个训练师，所以最大答案是 1 。
+</pre>
+
+<p>&nbsp;</p>
+
+<p><strong>提示：</strong></p>
+
+<ul>
+	<li><code>1 &lt;= players.length, trainers.length &lt;= 10<sup>5</sup></code></li>
+	<li><code>1 &lt;= players[i], trainers[j] &lt;= 10<sup>9</sup></code></li>
+</ul>

problems/problems_2410/solution.go

@@ -0,0 +1,26 @@
+package problem2410
+
+import (
+	"encoding/json"
+	"log"
+	"strings"
+)
+
+func matchPlayersAndTrainers(players []int, trainers []int) int {
+    
+}
+
+func Solve(inputJsonValues string) any {
+	inputValues := strings.Split(inputJsonValues, "\n")
+	var players []int
+	var trainers []int
+
+	if err := json.Unmarshal([]byte(inputValues[0]), &players); err != nil {
+		log.Fatal(err)
+	}
+	if err := json.Unmarshal([]byte(inputValues[1]), &trainers); err != nil {
+		log.Fatal(err)
+	}
+
+	return matchPlayersAndTrainers(players, trainers)
+}

problems/problems_2410/solution.py

@@ -0,0 +1,11 @@
+import solution
+from typing import *
+
+
+class Solution(solution.Solution):
+    def solve(self, test_input=None):
+        return self.matchPlayersAndTrainers(*test_input)
+
+    def matchPlayersAndTrainers(self, players: List[int], trainers: List[int]) -> int:
+        pass
+