542 added

Author: aQua

Algorithms/0542.01-matrix/01-matrix.go

@@ -0,0 +1,7 @@
+package Problem0542
+
+func updateMatrix(matrix [][]int) [][]int {
+	res :=
+
+	return res
+}

Algorithms/0542.01-matrix/01-matrix_test.go

@@ -0,0 +1,60 @@
+package Problem0542
+
+import (
+	"fmt"
+	"testing"
+
+	"github.com/stretchr/testify/assert"
+)
+
+// tcs is testcase slice
+var tcs = []struct {
+	matrix [][]int
+	ans    [][]int
+}{
+
+	{
+		[][]int{
+			{0, 0, 0},
+			{0, 1, 0},
+			{0, 0, 0},
+		},
+		[][]int{
+			{0, 0, 0},
+			{0, 1, 0},
+			{0, 0, 0},
+		},
+	},
+
+	{
+		[][]int{
+			{0, 0, 0},
+			{0, 1, 0},
+			{1, 1, 1},
+		},
+		[][]int{
+			{0, 0, 0},
+			{0, 1, 0},
+			{1, 2, 1},
+		},
+	},
+
+	// 可以有多个 testcase
+}
+
+func Test_updateMatrix(t *testing.T) {
+	ast := assert.New(t)
+
+	for _, tc := range tcs {
+		fmt.Printf("~~%v~~\n", tc)
+		ast.Equal(tc.ans, updateMatrix(tc.matrix), "输入:%v", tc)
+	}
+}
+
+func Benchmark_updateMatrix(b *testing.B) {
+	for i := 0; i < b.N; i++ {
+		for _, tc := range tcs {
+			updateMatrix(tc.matrix)
+		}
+	}
+}

Algorithms/0542.01-matrix/README.md

@@ -0,0 +1,45 @@
+# [542. 01 Matrix](https://leetcode.com/problems/01-matrix/)
+
+## 题目
+
+Given a matrix consists of 0 and 1, find the distance of the nearest 0 for each cell.
+
+The distance between two adjacent cells is 1.
+
+Example 1:
+
+```text
+Input:
+0 0 0
+0 1 0
+0 0 0
+
+Output:
+0 0 0
+0 1 0
+0 0 0
+```
+
+Example 2:
+
+```text
+Input:
+0 0 0
+0 1 0
+1 1 1
+
+Output:
+0 0 0
+0 1 0
+1 2 1
+```
+
+Note:
+
+1. The number of elements of the given matrix will not exceed 10,000.
+1. There are at least one 0 in the given matrix.
+1. The cells are adjacent in only four directions: up, down, left and right.
+
+## 解题思路
+
+见程序注释