LeetCode 剑指 Offer 29. 顺时针打印矩阵 - Go 实现

剑指 Offer 29. 顺时针打印矩阵

输入一个矩阵，按照从外向里以顺时针的顺序依次打印出每一个数字。

示例 1：

输入：matrix = [[1,2,3],[4,5,6],[7,8,9]]
输出：[1,2,3,6,9,8,7,4,5]

示例 2：

输入：matrix = [[1,2,3,4],[5,6,7,8],[9,10,11,12]]
输出：[1,2,3,4,8,12,11,10,9,5,6,7]

限制：

0 <= matrix.length <= 100
0 <= matrix[i].length <= 100

AC 代码

func spiralOrder(matrix [][]int) []int {

    if matrix == nil || len(matrix) == 0 {
        return []int{}
    }

    a := len(matrix)
    b := len(matrix[0])

    //fmt.Println(a, b)

    arr := make([]int, a*b)

    k := 0
    start := 0

    for start*2  < a && start*2 < b {
        endX := a - start -1
        endY := b - start -1
        //fmt.Println(endX, endY)
        for i := start; i <= endY; i++ {
            arr[k] = matrix[start][i]
            k++
        }

        if endX > start {
            for i := start + 1; i <= endX; i++ {
                arr[k] = matrix[i][endY]
                k++
            }
        }

        if endY > start && endX > start {
             for i := endY -1; i >= start; i-- {
                arr[k] = matrix[endX][i]
                k++
            }
        }
       
        
        if endY > start && endX > start {
            for i := endX -1; i > start ; i-- {
                arr[k] = matrix[i][start]
                k++;
            }
        }
    
        start++
        //fmt.Println(endX)

    }
    //fmt.Println(arr)

    return arr
}

欢迎关注公众号: 程序员开发者社区