Merge pull request #596 from 0xff-dev/542

Add solution and test-cases for problem 542

leetcode/501-600/0542.01-Matrix/README.md

@@ -1,28 +1,27 @@
 # [542.01 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
+Given an `m x n` binary matrix `mat`, return the distance of the nearest `0` for each cell.
+
+The distance between two adjacent cells is `1`.
+
+**Example 1:**  
 
-**Example 1:**
+![example1](./01-1-grid.jpeg)
 
 ```
-Input: a = "11", b = "1"
-Output: "100"
+Input: mat = [[0,0,0],[0,1,0],[0,0,0]]
+Output: [[0,0,0],[0,1,0],[0,0,0]]
 ```
 
-## 题意
-> ...
+**Example 2:**  
 
-## 题解
+![example2](./01-2-grid.jpeg)
 
-### 思路1
-> ...
-01 Matrix
-```go
 ```
-
+Input: mat = [[0,0,0],[0,1,0],[1,1,1]]
+Output: [[0,0,0],[0,1,0],[1,2,1]]
+```
 
 ## 结语
 

leetcode/501-600/0542.01-Matrix/Solution.go

@@ -1,5 +1,37 @@
 package Solution
 
-func Solution(x bool) bool {
-	return x
+import "math"
+
+func Solution(mat [][]int) [][]int {
+	rows := len(mat)
+	cols := len(mat[0])
+	zeroPoints := make([][2]int, 0)
+	for r := 0; r < rows; r++ {
+		for c := 0; c < cols; c++ {
+			if mat[r][c] == 0 {
+				zeroPoints = append(zeroPoints, [2]int{r, c})
+				continue
+			}
+			mat[r][c] = math.MaxInt
+		}
+	}
+	var dirs = [][]int{
+		{1, 0}, {0, 1}, {-1, 0}, {0, -1},
+	}
+	for len(zeroPoints) > 0 {
+		next := make([][2]int, 0)
+		for _, item := range zeroPoints {
+			for _, dir := range dirs {
+				nx, ny := item[0]+dir[0], item[1]+dir[1]
+				if nx < 0 || nx >= rows || ny < 0 || ny >= cols || mat[nx][ny] <= mat[item[0]][item[1]]+1 {
+					continue
+				}
+				mat[nx][ny] = mat[item[0]][item[1]] + 1
+				next = append(next, [2]int{nx, ny})
+			}
+		}
+		zeroPoints = next
+	}
+	return mat
+
 }

leetcode/501-600/0542.01-Matrix/Solution_test.go

@@ -10,12 +10,12 @@ 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{{1, 1, 1}, {1, 1, 1}, {1, 1, 1}, {1, 1, 1}, {1, 1, 1}, {1, 1, 1}, {1, 1, 1}, {1, 1, 1}, {1, 1, 1}, {1, 1, 1}, {1, 1, 1}, {1, 1, 1}, {1, 1, 1}, {1, 1, 1}, {1, 1, 1}, {1, 1, 1}, {1, 1, 1}, {1, 1, 1}, {1, 1, 1}, {0, 0, 0}},
+			[][]int{{19, 19, 19}, {18, 18, 18}, {17, 17, 17}, {16, 16, 16}, {15, 15, 15}, {14, 14, 14}, {13, 13, 13}, {12, 12, 12}, {11, 11, 11}, {10, 10, 10}, {9, 9, 9}, {8, 8, 8}, {7, 7, 7}, {6, 6, 6}, {5, 5, 5}, {4, 4, 4}, {3, 3, 3}, {2, 2, 2}, {1, 1, 1}, {0, 0, 0}}},
+		{"TestCase2", [][]int{{0, 0, 0}, {0, 1, 0}, {0, 0, 0}}, [][]int{{0, 0, 0}, {0, 1, 0}, {0, 0, 0}}},
 	}
 
 	//	开始测试
@@ -30,10 +30,10 @@ func TestSolution(t *testing.T) {
 	}
 }
 
-//	压力测试
+// 压力测试
 func BenchmarkSolution(b *testing.B) {
 }
 
-//	使用案列
+// 使用案列
 func ExampleSolution() {
 }