Merge pull request #877 from 0xff-dev/2373

Add solution and test-cases for problem 2373

Author: 6boris

leetcode/2301-2400/2373.Largest-Local-Values-in-a-Matrix/README.md

@@ -1,28 +1,35 @@
 # [2373.Largest Local Values in a Matrix][title]
 
-> [!WARNING|style:flat]
-> This question is temporarily unanswered if you have good ideas. Welcome to [Create Pull Request PR](https://github.com/kylesliu/awesome-golang-algorithm)
-
 ## Description
+You are given an `n x n` integer matrix `grid`.
+
+Generate an integer matrix `maxLocal` of size `(n - 2) x (n - 2)` such that:
+
+- `maxLocal[i][j]` is equal to the `largest` value of the `3 x 3` matrix in `grid` centered around row `i + 1` and column `j + 1`.
+In other words, we want to find the largest value in every contiguous `3 x 3` matrix in `grid`.
+
+Return the generated matrix.
 
-**Example 1:**
+**Example 1:**  
+
+![1](./ex1.png)
 
 ```
-Input: a = "11", b = "1"
-Output: "100"
+Input: grid = [[9,9,8,1],[5,6,2,6],[8,2,6,4],[6,2,2,2]]
+Output: [[9,9],[8,6]]
+Explanation: The diagram above shows the original matrix and the generated matrix.
+Notice that each value in the generated matrix corresponds to the largest value of a contiguous 3 x 3 matrix in grid.
 ```
 
-## 题意
-> ...
+**Example 2:**  
 
-## 题解
+![2](./ex2new2.png)
 
-### 思路1
-> ...
-Largest Local Values in a Matrix
-```go
 ```
-
+Input: grid = [[1,1,1,1,1],[1,1,1,1,1],[1,1,2,1,1],[1,1,1,1,1],[1,1,1,1,1]]
+Output: [[2,2,2],[2,2,2],[2,2,2]]
+Explanation: Notice that the 2 is contained within every contiguous 3 x 3 matrix in grid.
+```
 
 ## 结语
 

leetcode/2301-2400/2373.Largest-Local-Values-in-a-Matrix/Solution.go

@@ -1,5 +1,25 @@
 package Solution
 
-func Solution(x bool) bool {
-	return x
+func Solution(grid [][]int) [][]int {
+	rows, cols := len(grid), len(grid[0])
+	ans := make([][]int, rows-2)
+	for i := 0; i < rows-2; i++ {
+		ans[i] = make([]int, cols-2)
+	}
+	for r := 1; r < rows-1; r++ {
+		for c := 1; c < cols-1; c++ {
+			cur := grid[r][c]
+			cur = max(cur, grid[r-1][c-1])
+			cur = max(cur, grid[r-1][c])
+			cur = max(cur, grid[r-1][c+1])
+			cur = max(cur, grid[r][c-1])
+			cur = max(cur, grid[r][c+1])
+			cur = max(cur, grid[r+1][c-1])
+			cur = max(cur, grid[r+1][c])
+			cur = max(cur, grid[r+1][c+1])
+			ans[r-1][c-1] = cur
+		}
+	}
+
+	return ans
 }

leetcode/2301-2400/2373.Largest-Local-Values-in-a-Matrix/Solution_test.go

@@ -10,12 +10,18 @@ func TestSolution(t *testing.T) {
 	//	测试用例
 	cases := []struct {
 		name   string
-		inputs bool
-		expect bool
+		inputs [][]int
+		expect [][]int
 	}{
-		{"TestCase", true, true},
-		{"TestCase", true, true},
-		{"TestCase", false, false},
+		{"TestCase1", [][]int{
+			{9, 9, 8, 1}, {5, 6, 2, 6}, {8, 2, 6, 4}, {6, 2, 2, 2},
+		}, [][]int{{9, 9}, {8, 6}}},
+		{"TestCase2", [][]int{
+			{1, 1, 1, 1, 1}, {1, 1, 1, 1, 1},
+			{1, 1, 2, 1, 1}, {1, 1, 1, 1, 1}, {1, 1, 1, 1, 1},
+		}, [][]int{
+			{2, 2, 2}, {2, 2, 2}, {2, 2, 2},
+		}},
 	}
 
 	//	开始测试
@@ -30,10 +36,10 @@ func TestSolution(t *testing.T) {
 	}
 }
 
-//	压力测试
+// 压力测试
 func BenchmarkSolution(b *testing.B) {
 }
 
-//	使用案列
+// 使用案列
 func ExampleSolution() {
 }