Add solution and test-cases for problem 885

Author: 0xff-dev

leetcode/801-900/0885.Spiral-Matrix-III/README.md

@@ -1,28 +1,29 @@
 # [885.Spiral Matrix III][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 start at the cell `(rStart, cStart)` of an `rows x cols` grid facing east. The northwest corner is at the first row and column in the grid, and the southeast corner is at the last row and column.
+
+You will walk in a clockwise spiral shape to visit every position in this grid. Whenever you move outside the grid's boundary, we continue our walk outside the grid (but may return to the grid boundary later.). Eventually, we reach all `rows * cols` spaces of the grid.
+
+Return an array of coordinates representing the positions of the grid in the order you visited them.
 
-**Example 1:**
+**Example 1:**  
+
+![1](./example_1.png)
 
 ```
-Input: a = "11", b = "1"
-Output: "100"
+Input: rows = 1, cols = 4, rStart = 0, cStart = 0
+Output: [[0,0],[0,1],[0,2],[0,3]]
 ```
 
-## 题意
-> ...
+**Example 2:**  
 
-## 题解
+![2](./example_2.png)
 
-### 思路1
-> ...
-Spiral Matrix III
-```go
 ```
-
+Input: rows = 5, cols = 6, rStart = 1, cStart = 4
+Output: [[1,4],[1,5],[2,5],[2,4],[2,3],[1,3],[0,3],[0,4],[0,5],[3,5],[3,4],[3,3],[3,2],[2,2],[1,2],[0,2],[4,5],[4,4],[4,3],[4,2],[4,1],[3,1],[2,1],[1,1],[0,1],[4,0],[3,0],[2,0],[1,0],[0,0]]
+```
 
 ## 结语
 

leetcode/801-900/0885.Spiral-Matrix-III/Solution.go

@@ -1,5 +1,50 @@
 package Solution
 
-func Solution(x bool) bool {
-	return x
+func Solution(rows int, cols int, rStart int, cStart int) [][]int {
+	ans := make([][]int, 0)
+	steps := 1
+	first := true
+	end := rows * cols
+	for end > 0 {
+		if rStart >= 0 && rStart < rows && cStart >= 0 && cStart < cols {
+			ans = append(ans, []int{rStart, cStart})
+			end--
+		}
+		//right
+		if !first {
+			for s := steps - 1; s > 0 && end > 0; s-- {
+				rStart--
+				if rStart >= 0 && rStart < rows && cStart >= 0 && cStart < cols {
+					ans = append(ans, []int{rStart, cStart})
+					end--
+				}
+			}
+		}
+		for s := steps; s > 0 && end > 0; s-- {
+			cStart++
+			if rStart >= 0 && rStart < rows && cStart >= 0 && cStart < cols {
+				ans = append(ans, []int{rStart, cStart})
+				end--
+			}
+		}
+		for s := steps; s > 0 && end > 0; s-- {
+			rStart++
+			if rStart >= 0 && rStart < rows && cStart >= 0 && cStart < cols {
+				ans = append(ans, []int{rStart, cStart})
+				end--
+			}
+		}
+
+		for s := steps; s > 0 && end > 0; s-- {
+			cStart--
+			if rStart >= 0 && rStart < rows && cStart >= 0 && cStart < cols {
+				ans = append(ans, []int{rStart, cStart})
+				end--
+			}
+		}
+		cStart--
+		steps += 2
+		first = false
+	}
+	return ans
 }

leetcode/801-900/0885.Spiral-Matrix-III/Solution_test.go

@@ -9,31 +9,30 @@ import (
 func TestSolution(t *testing.T) {
 	//	测试用例
 	cases := []struct {
-		name   string
-		inputs bool
-		expect bool
+		name             string
+		rows, cols, r, c int
+		expect           [][]int
 	}{
-		{"TestCase", true, true},
-		{"TestCase", true, true},
-		{"TestCase", false, false},
+		{"TestCase1", 1, 4, 0, 0, [][]int{{0, 0}, {0, 1}, {0, 2}, {0, 3}}},
+		{"TestCase2", 5, 6, 1, 4, [][]int{{1, 4}, {1, 5}, {2, 5}, {2, 4}, {2, 3}, {1, 3}, {0, 3}, {0, 4}, {0, 5}, {3, 5}, {3, 4}, {3, 3}, {3, 2}, {2, 2}, {1, 2}, {0, 2}, {4, 5}, {4, 4}, {4, 3}, {4, 2}, {4, 1}, {3, 1}, {2, 1}, {1, 1}, {0, 1}, {4, 0}, {3, 0}, {2, 0}, {1, 0}, {0, 0}}},
 	}
 
 	//	开始测试
 	for i, c := range cases {
 		t.Run(c.name+" "+strconv.Itoa(i), func(t *testing.T) {
-			got := Solution(c.inputs)
+			got := Solution(c.rows, c.cols, c.r, c.c)
 			if !reflect.DeepEqual(got, c.expect) {
-				t.Fatalf("expected: %v, but got: %v, with inputs: %v",
-					c.expect, got, c.inputs)
+				t.Fatalf("expected: %v, but got: %v, with inputs: %v %v %v %v",
+					c.expect, got, c.rows, c.cols, c.r, c.c)
 			}
 		})
 	}
 }
 
-//	压力测试
+// 压力测试
 func BenchmarkSolution(b *testing.B) {
 }
 
-//	使用案列
+// 使用案列
 func ExampleSolution() {
 }