test: 2410 solution

py, c++, go, java

Author: QuBenhao

problems/problems_2410/Solution.cpp

@@ -1,29 +1,38 @@
 //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) {
-        
+  int matchPlayersAndTrainers(vector<int> &players, vector<int> &trainers) {
+    sort(players.begin(), players.end());
+    sort(trainers.begin(), trainers.end());
+    int ans = 0;
+    int m = players.size(), n = trainers.size();
+    for (int i = 0, j = 0; i < m && j < n; ++j) {
+      if (players[i] <= trainers[j]) {
+        ++ans;
+        ++i;
+      }
     }
+    return ans;
+  }
 };
 
 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);
+  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);
+  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

@@ -7,7 +7,19 @@
 
 public class Solution extends BaseSolution {
     public int matchPlayersAndTrainers(int[] players, int[] trainers) {
-        
+        Arrays.sort(players);
+        Arrays.sort(trainers);
+        int i = 0, m = players.length;
+        int ans = 0;
+        for (int train: trainers) {
+            if (players[i] <= train) {
+                ++ans;
+                if (++i == m) {
+                    return m;
+                }
+            }
+        }
+        return ans;
     }
 
     @Override

problems/problems_2410/solution.go

@@ -3,11 +3,24 @@ package problem2410
 import (
 	"encoding/json"
 	"log"
+	"sort"
 	"strings"
 )
 
-func matchPlayersAndTrainers(players []int, trainers []int) int {
-    
+func matchPlayersAndTrainers(players []int, trainers []int) (ans int) {
+	sort.Ints(players)
+	sort.Ints(trainers)
+	i, m := 0, len(players)
+	for _, train := range trainers {
+		if players[i] <= train {
+			ans++
+			i++
+			if i == m {
+				break
+			}
+		}
+	}
+	return
 }
 
 func Solve(inputJsonValues string) any {

problems/problems_2410/solution.py

@@ -7,5 +7,14 @@ def solve(self, test_input=None):
         return self.matchPlayersAndTrainers(*test_input)
 
     def matchPlayersAndTrainers(self, players: List[int], trainers: List[int]) -> int:
-        pass
-
+        players.sort()
+        trainers.sort()
+        ans = 0
+        i = 0
+        for train in trainers:
+            if players[i] <= train:
+                ans += 1
+                i += 1
+                if i == len(players):
+                    break
+        return ans