test: [20250901] Add (1792)

Author: actions-user

Cargo.toml

@@ -304,6 +304,7 @@ members = [
 	"problems/problems_3021",
 	"problems/problems_36",
 	"problems/problems_37",
+	"problems/problems_1792",
 ]
 
 [package]
@@ -630,3 +631,4 @@ solution_3446 = { path = "problems/problems_3446", features = ["solution_3446"]
 solution_3021 = { path = "problems/problems_3021", features = ["solution_3021"] }
 solution_36 = { path = "problems/problems_36", features = ["solution_36"] }
 solution_37 = { path = "problems/problems_37", features = ["solution_37"] }
+solution_1792 = { path = "problems/problems_1792", features = ["solution_1792"] }

daily-problems.json

@@ -1,4 +1,4 @@
 {
-    "daily": "3670",
+    "daily": "1792",
     "plans": ["3663", "problems", "3664", "problems", "3665", "problems", "3668", "problems", "3669", "problems", "3670", "problems"]
 }

golang/solution_test.go

@@ -1,10 +1,10 @@
 package golang
 
 import (
-	problem "leetCode/problems/problems_37"
+	problem "leetCode/problems/problems_1792"
 	"testing"
 )
 
 func TestSolution(t *testing.T) {
-	TestEach(t, "37", "problems", problem.Solve)
+	TestEach(t, "1792", "problems", problem.Solve)
 }

problems/problems_1792/Cargo.toml

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

problems/problems_1792/Solution.cpp

@@ -0,0 +1,29 @@
+//go:build ignore
+#include "cpp/common/Solution.h"
+
+
+using namespace std;
+using json = nlohmann::json;
+
+class Solution {
+public:
+    double maxAverageRatio(vector<vector<int>>& classes, int extraStudents) {
+        
+    }
+};
+
+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<vector<int>> classes = json::parse(inputArray.at(0));
+	int extraStudents = json::parse(inputArray.at(1));
+	return solution.maxAverageRatio(classes, extraStudents);
+}

problems/problems_1792/Solution.java

@@ -0,0 +1,19 @@
+package problems.problems_1792;
+
+import com.alibaba.fastjson.JSON;
+import java.util.*;
+import qubhjava.BaseSolution;
+
+
+public class Solution extends BaseSolution {
+    public double maxAverageRatio(int[][] classes, int extraStudents) {
+        
+    }
+
+    @Override
+    public Object solve(String[] inputJsonValues) {
+        int[][] classes = jsonArrayToInt2DArray(inputJsonValues[0]);
+		int extraStudents = Integer.parseInt(inputJsonValues[1]);
+        return JSON.toJSON(maxAverageRatio(classes, extraStudents));
+    }
+}

problems/problems_1792/problem.md

@@ -1,36 +1,35 @@
 # 1792. Maximum Average Pass Ratio [Rating: 1818.00]
 
-There is a school that has classes of students and each class will be having a final exam. You are given a 2D integer array `classes`, where `classes[i] = [passi, totali]`. You know beforehand that in the `ith`class, there are `totali` total students, but only `passi` number of students will pass the exam.
+<p>There is a school that has classes of students and each class will be having a final exam. You are given a 2D integer array <code>classes</code>, where <code>classes[i] = [pass<sub>i</sub>, total<sub>i</sub>]</code>. You know beforehand that in the <code>i<sup>th</sup></code> class, there are <code>total<sub>i</sub></code> total students, but only <code>pass<sub>i</sub></code> number of students will pass the exam.</p>
 
-You are also given an integer `extraStudents`. There are another `extraStudents` brilliant students that are **guaranteed** to pass the exam of any class they are assigned to. You want to assign each of the `extraStudents` students to a class in a way that **maximizes** the **average** pass ratio across **all** the classes.
+<p>You are also given an integer <code>extraStudents</code>. There are another <code>extraStudents</code> brilliant students that are <strong>guaranteed</strong> to pass the exam of any class they are assigned to. You want to assign each of the <code>extraStudents</code> students to a class in a way that <strong>maximizes</strong> the <strong>average</strong> pass ratio across <strong>all</strong> the classes.</p>
 
-The **pass ratio** of a class is equal to the number of students of the class that will pass the exam divided by the total number of students of the class. The **average pass ratio** is the sum of pass ratios of all the classes divided by the number of the classes.
+<p>The <strong>pass ratio</strong> of a class is equal to the number of students of the class that will pass the exam divided by the total number of students of the class. The <strong>average pass ratio</strong> is the sum of pass ratios of all the classes divided by the number of the classes.</p>
 
-Return *the **maximum** possible average pass ratio after assigning the* `extraStudents` *students.* Answers within 10<sup>-5</sup> of the actual answer will be accepted.
+<p>Return <em>the <strong>maximum</strong> possible average pass ratio after assigning the </em><code>extraStudents</code><em> students. </em>Answers within <code>10<sup>-5</sup></code> of the actual answer will be accepted.</p>
 
- 
+<p>&nbsp;</p>
+<p><strong class="example">Example 1:</strong></p>
 
-**Example 1:**
+<pre>
+<strong>Input:</strong> classes = [[1,2],[3,5],[2,2]], <code>extraStudents</code> = 2
+<strong>Output:</strong> 0.78333
+<strong>Explanation:</strong> You can assign the two extra students to the first class. The average pass ratio will be equal to (3/4 + 3/5 + 2/2) / 3 = 0.78333.
+</pre>
 
-```
-Input: classes = [[1,2],[3,5],[2,2]], extraStudents = 2
-Output: 0.78333
-Explanation: You can assign the two extra students to the first class. The average pass ratio will be equal to (3/4 + 3/5 + 2/2) / 3 = 0.78333.
-```
+<p><strong class="example">Example 2:</strong></p>
 
-**Example 2:**
+<pre>
+<strong>Input:</strong> classes = [[2,4],[3,9],[4,5],[2,10]], <code>extraStudents</code> = 4
+<strong>Output:</strong> 0.53485
+</pre>
 
-```
-Input: classes = [[2,4],[3,9],[4,5],[2,10]], extraStudents = 4
-Output: 0.53485
-```
-
- 
-
-**Constraints:**
-
-- 1 <= classes.length <= 10<sup>5</sup>
-- `classes[i].length == 2`
-- 1 <= passi <= totali <= 10<sup>5</sup>
-- 1 <= extraStudents <= 10<sup>5</sup>
+<p>&nbsp;</p>
+<p><strong>Constraints:</strong></p>
 
+<ul>
+	<li><code>1 &lt;= classes.length &lt;= 10<sup>5</sup></code></li>
+	<li><code>classes[i].length == 2</code></li>
+	<li><code>1 &lt;= pass<sub>i</sub> &lt;= total<sub>i</sub> &lt;= 10<sup>5</sup></code></li>
+	<li><code>1 &lt;= extraStudents &lt;= 10<sup>5</sup></code></li>
+</ul>

problems/problems_1792/problem_zh.md

@@ -0,0 +1,37 @@
+# 1792. 最大平均通过率 [难度分: 1818.00]
+
+<p>一所学校里有一些班级，每个班级里有一些学生，现在每个班都会进行一场期末考试。给你一个二维数组 <code>classes</code> ，其中 <code>classes[i] = [pass<sub>i</sub>, total<sub>i</sub>]</code> ，表示你提前知道了第 <code>i</code> 个班级总共有 <code>total<sub>i</sub></code> 个学生，其中只有 <code>pass<sub>i</sub></code> 个学生可以通过考试。</p>
+
+<p>给你一个整数 <code>extraStudents</code> ，表示额外有 <code>extraStudents</code> 个聪明的学生，他们 <strong>一定</strong> 能通过任何班级的期末考。你需要给这 <code>extraStudents</code> 个学生每人都安排一个班级，使得 <strong>所有</strong> 班级的 <strong>平均</strong> 通过率 <strong>最大</strong> 。</p>
+
+<p>一个班级的 <strong>通过率</strong> 等于这个班级通过考试的学生人数除以这个班级的总人数。<strong>平均通过率</strong> 是所有班级的通过率之和除以班级数目。</p>
+
+<p>请你返回在安排这 <code><span style="">extraStudents</span></code> 个学生去对应班级后的 <strong>最大</strong> 平均通过率。与标准答案误差范围在 <code>10<sup>-5</sup></code> 以内的结果都会视为正确结果。</p>
+
+<p> </p>
+
+<p><strong>示例 1：</strong></p>
+
+<pre>
+<b>输入：</b>classes = [[1,2],[3,5],[2,2]], <code>extraStudents</code> = 2
+<b>输出：</b>0.78333
+<b>解释：</b>你可以将额外的两个学生都安排到第一个班级，平均通过率为 (3/4 + 3/5 + 2/2) / 3 = 0.78333 。
+</pre>
+
+<p><strong>示例 2：</strong></p>
+
+<pre>
+<b>输入：</b>classes = [[2,4],[3,9],[4,5],[2,10]], <code>extraStudents</code> = 4
+<strong>输出：</strong>0.53485
+</pre>
+
+<p> </p>
+
+<p><strong>提示：</strong></p>
+
+<ul>
+	<li><code>1 <= classes.length <= 10<sup>5</sup></code></li>
+	<li><code>classes[i].length == 2</code></li>
+	<li><code>1 <= pass<sub>i</sub> <= total<sub>i</sub> <= 10<sup>5</sup></code></li>
+	<li><code>1 <= extraStudents <= 10<sup>5</sup></code></li>
+</ul>

problems/problems_1792/solution.rs

@@ -0,0 +1,17 @@
+use serde_json::{json, Value};
+
+pub struct Solution;
+
+impl Solution {
+    pub fn max_average_ratio(classes: Vec<Vec<i32>>, extra_students: i32) -> f64 {
+        
+    }
+}
+
+#[cfg(feature = "solution_1792")]
+pub fn solve(input_string: String) -> Value {
+	let input_values: Vec<String> = input_string.split('\n').map(|x| x.to_string()).collect();
+	let classes: Vec<Vec<i32>> = serde_json::from_str(&input_values[0]).expect("Failed to parse input");
+	let extra_students: i32 = serde_json::from_str(&input_values[1]).expect("Failed to parse input");
+	json!(Solution::max_average_ratio(classes, extra_students))
+}

problems/problems_1792/solution.ts

@@ -0,0 +1,10 @@
+function maxAverageRatio(classes: number[][], extraStudents: number): number {
+    
+};
+
+export function Solve(inputJsonElement: string): any {
+	const inputValues: string[] = inputJsonElement.split("\n");
+	const classes: number[][] = JSON.parse(inputValues[0]);
+	const extraStudents: number = JSON.parse(inputValues[1]);
+	return maxAverageRatio(classes, extraStudents);
+}