feat: finish 54

Author: plh97

algorithm/54.SpiralMatrix/README.md

@@ -0,0 +1,31 @@
+# [54. Spiral Matrix](https://leetcode.com/problems/spiral-matrix/)
+
+## 2019/09/15
+
+### 题目 💗[medium]
+
+Given a matrix of m x n elements (m rows, n columns), return all elements of the matrix in spiral order.
+
+Example 1:
+
+```bash
+Input:
+[
+ [ 1, 2, 3 ],
+ [ 4, 5, 6 ],
+ [ 7, 8, 9 ]
+]
+Output: [1,2,3,6,9,8,7,4,5]
+```
+
+Example 2:
+
+```bash
+Input:
+[
+  [1, 2, 3, 4],
+  [5, 6, 7, 8],
+  [9,10,11,12]
+]
+Output: [1,2,3,4,8,12,11,10,9,5,6,7]
+```

algorithm/54.SpiralMatrix/main.go

@@ -0,0 +1,61 @@
+package spiralOrder
+
+var hasSeen map[int]bool
+
+func spiralOrder(matrix [][]int) []int {
+	if len(matrix) == 0 {
+		return []int{}
+	}
+	hasSeen = map[int]bool{}
+	lenx := len(matrix[0])
+	leny := len(matrix)
+	res := []int{}
+	x, y := 0, 0
+	direct := 0
+	for i := 0; i < lenx*leny; i++ {
+
+		res = append(res, matrix[y][x])
+		hasSeen[matrix[y][x]] = true
+		if isBound(matrix, x, y, direct) {
+			direct++
+		}
+		switch direct % 4 {
+		case 0:
+			// right 	0
+			x++
+		case 1:
+			// down 	1
+			y++
+		case 2:
+			// left 	2
+			x--
+		case 3:
+			// up 		3
+			y--
+		}
+	}
+	return res
+}
+
+func isBound(matrix [][]int, x, y, direct int) bool {
+	switch direct % 4 {
+	case 0:
+		x++
+	case 1:
+		y++
+	case 2:
+		x--
+	case 3:
+		y--
+	}
+	if x < 0 ||
+		y < 0 ||
+		y > len(matrix)-1 ||
+		x > len(matrix[0])-1 {
+		return true
+	}
+	if _, ok := hasSeen[matrix[y][x]]; ok {
+		return true
+	}
+	return false
+}

algorithm/54.SpiralMatrix/main_test.go

@@ -0,0 +1,40 @@
+package spiralOrder
+
+import (
+	"testing"
+
+	"github.com/stretchr/testify/assert"
+)
+
+var tcs = []struct {
+	N1  [][]int
+	ans []int
+}{
+	{
+		[][]int{
+			[]int{1, 2, 3},
+			[]int{4, 5, 6},
+			[]int{7, 8, 9},
+		},
+		[]int{1, 2, 3, 6, 9, 8, 7, 4, 5},
+	},
+	{
+		[][]int{
+			[]int{1, 2, 3, 4},
+			[]int{5, 6, 7, 8},
+			[]int{9, 10, 11, 12},
+		},
+		[]int{1, 2, 3, 4, 8, 12, 11, 10, 9, 5, 6, 7},
+	},
+	{
+		[][]int{},
+		[]int{},
+	},
+}
+
+func Test_bitwiseComplement(t *testing.T) {
+	ast := assert.New(t)
+	for _, tc := range tcs {
+		ast.Equal(tc.ans, spiralOrder(tc.N1), "输入:%v", tc)
+	}
+}