我认为你问题中的问题是寻找一个螺旋矩阵。它有多种实施方式。这里有一个基于迭代的方法来制作你要求的螺旋矩阵

代码

# n and m deonte matrix row and column numbers, respectively
SpiralMatrix <- function(n, m) {
    mat <- matrix(NA, n, m)
    N <- m*n
    u <- l <- 1
    d <- n
    r <- m
    idx <- 1
    while (u <= d && l <= r) {
        # up to down
        for (i in u:d) {
            mat[i, l] <- idx
            if (idx == N) {
                return(mat)
            }
            idx <- idx + 1
        }
        l <- l + 1
        # left to right
        for (i in l:r) {
            mat[d, i] <- idx
            if (idx == N) {
                return(mat)
            }
            idx <- idx + 1
        }
        d <- d - 1
        # down to up
        for (i in d:u) {
            mat[i, r] <- idx
            if (idx == N) {
                return(mat)
            }
            idx <- idx + 1
        }
        r <- r - 1
        # right to left
        for (i in r:l) {
            mat[u, i] <- idx
            if (idx == N) {
                return(mat)
            }
            idx <- idx + 1
        }
        u <- u + 1
    }
}

输出示例

> SpiralMatrix(3, 4)
     [,1] [,2] [,3] [,4]
[1,]    1   10    9    8
[2,]    2   11   12    7
[3,]    3    4    5    6

> SpiralMatrix(5, 3)
     [,1] [,2] [,3]
[1,]    1   12   11
[2,]    2   13   10
[3,]    3   14    9
[4,]    4   15    8
[5,]    5    6    7

> SpiralMatrix(4, 4)
     [,1] [,2] [,3] [,4]
[1,]    1   12   11   10
[2,]    2   13   16    9
[3,]    3   14   15    8
[4,]    4    5    6    7