test: [20250831] Add (37)

Author: actions-user

Cargo.toml

@@ -303,6 +303,7 @@ members = [
 	"problems/problems_3446",
 	"problems/problems_3021",
 	"problems/problems_36",
+	"problems/problems_37",
 ]
 
 [package]
@@ -628,3 +629,4 @@ solution_3459 = { path = "problems/problems_3459", features = ["solution_3459"]
 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"] }

daily-problems.json

@@ -1,4 +1,4 @@
 {
-    "daily": "1051",
+    "daily": "37",
     "plans": ["3652", "problems", "3653", "problems", "3654", "problems"]
 }

golang/solution_test.go

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

problems/problems_37/Cargo.toml

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

problems/problems_37/Solution.cpp

@@ -0,0 +1,35 @@
+//go:build ignore
+#include "cpp/common/Solution.h"
+
+
+using namespace std;
+using json = nlohmann::json;
+
+class Solution {
+public:
+    void solveSudoku(vector<vector<char>>& board) {
+        
+    }
+};
+
+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<string>> board_str = json::parse(inputArray.at(0));
+	auto board = vector<vector<char>>(board_str.size(), vector<char>(board_str[0].size()));
+	for (size_t i = 0; i < board.size(); ++i) {
+		for (size_t j = 0; j < board[i].size(); ++j) {
+			board[i][j] = board_str[i][j][0];
+		}
+	}
+	solution.solveSudoku(board);
+	return board;
+}

problems/problems_37/problem.md

@@ -1,32 +1,34 @@
-# 37. Sudoku Solver
+# 37. Sudoku Solver 
 
-Write a program to solve a Sudoku puzzle by filling the empty cells.
+<p>Write a program to solve a Sudoku puzzle by filling the empty cells.</p>
 
-A sudoku solution must satisfy **all of the following rules**:
+<p>A sudoku solution must satisfy <strong>all of the following rules</strong>:</p>
 
-1. Each of the digits `1-9` must occur exactly once in each row.
-2. Each of the digits `1-9` must occur exactly once in each column.
-3. Each of the digits `1-9` must occur exactly once in each of the 9 `3x3` sub-boxes of the grid.
+<ol>
+	<li>Each of the digits <code>1-9</code> must occur exactly once in each row.</li>
+	<li>Each of the digits <code>1-9</code> must occur exactly once in each column.</li>
+	<li>Each of the digits <code>1-9</code> must occur exactly once in each of the 9 <code>3x3</code> sub-boxes of the grid.</li>
+</ol>
 
-The `'.'` character indicates empty cells.
+<p>The <code>&#39;.&#39;</code> character indicates empty cells.</p>
 
- 
+<p>&nbsp;</p>
+<p><strong class="example">Example 1:</strong></p>
+<img src="https://upload.wikimedia.org/wikipedia/commons/thumb/f/ff/Sudoku-by-L2G-20050714.svg/250px-Sudoku-by-L2G-20050714.svg.png" style="height:250px; width:250px" />
+<pre>
+<strong>Input:</strong> board = [[&quot;5&quot;,&quot;3&quot;,&quot;.&quot;,&quot;.&quot;,&quot;7&quot;,&quot;.&quot;,&quot;.&quot;,&quot;.&quot;,&quot;.&quot;],[&quot;6&quot;,&quot;.&quot;,&quot;.&quot;,&quot;1&quot;,&quot;9&quot;,&quot;5&quot;,&quot;.&quot;,&quot;.&quot;,&quot;.&quot;],[&quot;.&quot;,&quot;9&quot;,&quot;8&quot;,&quot;.&quot;,&quot;.&quot;,&quot;.&quot;,&quot;.&quot;,&quot;6&quot;,&quot;.&quot;],[&quot;8&quot;,&quot;.&quot;,&quot;.&quot;,&quot;.&quot;,&quot;6&quot;,&quot;.&quot;,&quot;.&quot;,&quot;.&quot;,&quot;3&quot;],[&quot;4&quot;,&quot;.&quot;,&quot;.&quot;,&quot;8&quot;,&quot;.&quot;,&quot;3&quot;,&quot;.&quot;,&quot;.&quot;,&quot;1&quot;],[&quot;7&quot;,&quot;.&quot;,&quot;.&quot;,&quot;.&quot;,&quot;2&quot;,&quot;.&quot;,&quot;.&quot;,&quot;.&quot;,&quot;6&quot;],[&quot;.&quot;,&quot;6&quot;,&quot;.&quot;,&quot;.&quot;,&quot;.&quot;,&quot;.&quot;,&quot;2&quot;,&quot;8&quot;,&quot;.&quot;],[&quot;.&quot;,&quot;.&quot;,&quot;.&quot;,&quot;4&quot;,&quot;1&quot;,&quot;9&quot;,&quot;.&quot;,&quot;.&quot;,&quot;5&quot;],[&quot;.&quot;,&quot;.&quot;,&quot;.&quot;,&quot;.&quot;,&quot;8&quot;,&quot;.&quot;,&quot;.&quot;,&quot;7&quot;,&quot;9&quot;]]
+<strong>Output:</strong> [[&quot;5&quot;,&quot;3&quot;,&quot;4&quot;,&quot;6&quot;,&quot;7&quot;,&quot;8&quot;,&quot;9&quot;,&quot;1&quot;,&quot;2&quot;],[&quot;6&quot;,&quot;7&quot;,&quot;2&quot;,&quot;1&quot;,&quot;9&quot;,&quot;5&quot;,&quot;3&quot;,&quot;4&quot;,&quot;8&quot;],[&quot;1&quot;,&quot;9&quot;,&quot;8&quot;,&quot;3&quot;,&quot;4&quot;,&quot;2&quot;,&quot;5&quot;,&quot;6&quot;,&quot;7&quot;],[&quot;8&quot;,&quot;5&quot;,&quot;9&quot;,&quot;7&quot;,&quot;6&quot;,&quot;1&quot;,&quot;4&quot;,&quot;2&quot;,&quot;3&quot;],[&quot;4&quot;,&quot;2&quot;,&quot;6&quot;,&quot;8&quot;,&quot;5&quot;,&quot;3&quot;,&quot;7&quot;,&quot;9&quot;,&quot;1&quot;],[&quot;7&quot;,&quot;1&quot;,&quot;3&quot;,&quot;9&quot;,&quot;2&quot;,&quot;4&quot;,&quot;8&quot;,&quot;5&quot;,&quot;6&quot;],[&quot;9&quot;,&quot;6&quot;,&quot;1&quot;,&quot;5&quot;,&quot;3&quot;,&quot;7&quot;,&quot;2&quot;,&quot;8&quot;,&quot;4&quot;],[&quot;2&quot;,&quot;8&quot;,&quot;7&quot;,&quot;4&quot;,&quot;1&quot;,&quot;9&quot;,&quot;6&quot;,&quot;3&quot;,&quot;5&quot;],[&quot;3&quot;,&quot;4&quot;,&quot;5&quot;,&quot;2&quot;,&quot;8&quot;,&quot;6&quot;,&quot;1&quot;,&quot;7&quot;,&quot;9&quot;]]
+<strong>Explanation:</strong>&nbsp;The input board is shown above and the only valid solution is shown below:
 
-**Example 1:**
+<img src="https://upload.wikimedia.org/wikipedia/commons/thumb/3/31/Sudoku-by-L2G-20050714_solution.svg/250px-Sudoku-by-L2G-20050714_solution.svg.png" style="height:250px; width:250px" />
+</pre>
 
-![img](https://upload.wikimedia.org/wikipedia/commons/thumb/f/ff/Sudoku-by-L2G-20050714.svg/250px-Sudoku-by-L2G-20050714.svg.png)
+<p>&nbsp;</p>
+<p><strong>Constraints:</strong></p>
 
-```
-Input: board = [["5","3",".",".","7",".",".",".","."],["6",".",".","1","9","5",".",".","."],[".","9","8",".",".",".",".","6","."],["8",".",".",".","6",".",".",".","3"],["4",".",".","8",".","3",".",".","1"],["7",".",".",".","2",".",".",".","6"],[".","6",".",".",".",".","2","8","."],[".",".",".","4","1","9",".",".","5"],[".",".",".",".","8",".",".","7","9"]]
-Output: [["5","3","4","6","7","8","9","1","2"],["6","7","2","1","9","5","3","4","8"],["1","9","8","3","4","2","5","6","7"],["8","5","9","7","6","1","4","2","3"],["4","2","6","8","5","3","7","9","1"],["7","1","3","9","2","4","8","5","6"],["9","6","1","5","3","7","2","8","4"],["2","8","7","4","1","9","6","3","5"],["3","4","5","2","8","6","1","7","9"]]
-Explanation: The input board is shown above and the only valid solution is shown below:
-```
-
- 
-
-**Constraints:**
-
-- `board.length == 9`
-- `board[i].length == 9`
-- `board[i][j]` is a digit or `'.'`.
-- It is **guaranteed** that the input board has only one solution.
+<ul>
+	<li><code>board.length == 9</code></li>
+	<li><code>board[i].length == 9</code></li>
+	<li><code>board[i][j]</code> is a digit or <code>&#39;.&#39;</code>.</li>
+	<li>It is <strong>guaranteed</strong> that the input board has only one solution.</li>
+</ul>

problems/problems_37/problem_zh.md

@@ -0,0 +1,42 @@
+# 37. 解数独 
+
+<p>编写一个程序，通过填充空格来解决数独问题。</p>
+
+<p>数独的解法需<strong> 遵循如下规则</strong>：</p>
+
+<ol>
+	<li>数字&nbsp;<code>1-9</code>&nbsp;在每一行只能出现一次。</li>
+	<li>数字&nbsp;<code>1-9</code>&nbsp;在每一列只能出现一次。</li>
+	<li>数字&nbsp;<code>1-9</code>&nbsp;在每一个以粗实线分隔的&nbsp;<code>3x3</code>&nbsp;宫内只能出现一次。（请参考示例图）</li>
+</ol>
+
+<p>数独部分空格内已填入了数字，空白格用&nbsp;<code>'.'</code>&nbsp;表示。</p>
+
+<p>&nbsp;</p>
+
+<div class="top-view__1vxA">
+<div class="original__bRMd">
+<div>
+<p><strong>示例 1：</strong></p>
+<img src="https://assets.leetcode-cn.com/aliyun-lc-upload/uploads/2021/04/12/250px-sudoku-by-l2g-20050714svg.png" style="height:250px; width:250px" />
+<pre>
+<strong>输入：</strong>board = [["5","3",".",".","7",".",".",".","."],["6",".",".","1","9","5",".",".","."],[".","9","8",".",".",".",".","6","."],["8",".",".",".","6",".",".",".","3"],["4",".",".","8",".","3",".",".","1"],["7",".",".",".","2",".",".",".","6"],[".","6",".",".",".",".","2","8","."],[".",".",".","4","1","9",".",".","5"],[".",".",".",".","8",".",".","7","9"]]
+<strong>输出：</strong>[["5","3","4","6","7","8","9","1","2"],["6","7","2","1","9","5","3","4","8"],["1","9","8","3","4","2","5","6","7"],["8","5","9","7","6","1","4","2","3"],["4","2","6","8","5","3","7","9","1"],["7","1","3","9","2","4","8","5","6"],["9","6","1","5","3","7","2","8","4"],["2","8","7","4","1","9","6","3","5"],["3","4","5","2","8","6","1","7","9"]]
+<strong>解释：</strong>输入的数独如上图所示，唯一有效的解决方案如下所示：
+
+<img src=" https://assets.leetcode-cn.com/aliyun-lc-upload/uploads/2021/04/12/250px-sudoku-by-l2g-20050714_solutionsvg.png" style="height:250px; width:250px" />
+</pre>
+
+<p>&nbsp;</p>
+
+<p><strong>提示：</strong></p>
+
+<ul>
+	<li><code>board.length == 9</code></li>
+	<li><code>board[i].length == 9</code></li>
+	<li><code>board[i][j]</code> 是一位数字或者 <code>'.'</code></li>
+	<li>题目数据 <strong>保证</strong> 输入数独仅有一个解</li>
+</ul>
+</div>
+</div>
+</div>

problems/problems_37/solution.go

@@ -0,0 +1,39 @@
+package problem37
+
+import (
+	"encoding/json"
+	"log"
+	"strings"
+)
+
+func solveSudoku(board [][]byte)  {
+    
+}
+
+func Solve(inputJsonValues string) any {
+	inputValues := strings.Split(inputJsonValues, "\n")
+	var board [][]byte
+
+	var boardStr [][]string
+	if err := json.Unmarshal([]byte(inputValues[0]), &boardStr); err != nil {
+		log.Fatal(err)
+	}
+	board = make([][]byte, len(boardStr))
+	for i := 0; i < len(board); i++ {
+		board[i] = make([]byte, len(boardStr[i]))
+		for j := 0; j < len(board[i]); j++ {
+			board[i][j] = boardStr[i][j][0]
+		}
+	}
+
+	solveSudoku(board)
+	return byteArrToStrArr(board)
+}
+
+func byteArrToStrArr(arr [][]byte) []string {
+	ans := make([]string, len(arr))
+	for i, b := range arr {
+		ans[i] = string(b)
+	}
+	return ans
+}

problems/problems_37/solution.rs

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

problems/problems_37/solution.ts

@@ -0,0 +1,13 @@
+/**
+ Do not return anything, modify board in-place instead.
+ */
+function solveSudoku(board: string[][]): void {
+    
+};
+
+export function Solve(inputJsonElement: string): any {
+	const inputValues: string[] = inputJsonElement.split("\n");
+	const board: string[][] = JSON.parse(inputValues[0]);
+	solveSudoku(board)
+	return board;
+}