螺旋矩阵 leetcode59

初次尝试，从中心向外

func main() {n := 3fmt.Println(generateMatrix(n))
}// 初版，我们从中心点开始
func generateMatrix(n int) [][]int {//1.nXn矩阵table := make([][]int, n)for i := 0; i < n; i++ {table[i] = make([]int, n)//fmt.Println(table[i]) //确认生成n*n}//2.确定中心点位置//n=1,	(0,0)//n=2,	(1,0)//n=3,	(1,1)//n=4,	(2,1)var x, y = 0, 0 //中心点坐标x = n / 2y = (n - 1) / 2fmt.Println("n:", n, "	x:", x, "	y:", y)table[x][y] = n * n//3.填充var char = 0  //都是从横行开始移动, 横竖移动标志位var char2 int //到底是向左还是向右var char3 int //到底是向上还是向下if n%2 == 1 {char3 = 1char2 = -1} else {char3 = -1char2 = 1}var c = 1for t, i := 1, n*n-1; i >= 0; { //总共填入n*n个数 ,t为当前运行的次数，i为本次填入的数据for e := 0; e < 2; e++ {tem := (c + 1) / 2 //1,1,2,2,3,3if char == 0 { //横着动for tem > 0 {y = y + char2if y == n+1 || y == -1 {return table}table[x][y] = ii--t++tem--}char2 = -char2char = 1} else { //竖着动for tem > 0 {x = x + char3if x == n+1 || x == -1 {return table}table[x][y] = ii--t++if t == n*n {return table}tem--}char3 = -char3char = 0}c++}}return table
}

模拟方式

func generateMatrix(n int) [][]int {//1.nXn矩阵table := make([][]int, n)for i := 0; i < n; i++ {table[i] = make([]int, n)//fmt.Println(table[i]) //确认生成n*n}i := 1 //需要填入的数据c := n - 1layerNums := 0            //第几层for ; c >= 0; c = c - 2 { //记每次循环每层每边中间间隔的个数，c=0时为最后中心只有一个数的那层//n=2 2X2 C:1//n=3 3X3 C:2 -> 0/*1 2 3 4 5 67 8 9*///n=4 4X4 C:3 -> 1 /* 1  2  3  412 13 14 511 16 15 610  9  8 7*/x, y := layerNums, layerNums //记每层模拟的起始点table[x][y] = ifor b := 0; b < c; b++ {//先向右横table[x][y] = iy++i++}for b := 0; b < c; b++ {//向下竖table[x][y] = ix++i++}for b := 0; b < c; b++ {//向左横table[x][y] = iy--i++}for b := 0; b < c; b++ {//向上竖table[x][y] = ix--i++}//由于我们写入实际在下次循环才写入，所以最后一位的原点实际并未覆盖layerNums++//层数计数加一}return table
}