输出n2顺转方阵

void function(int**a,int n, int i, int j, int offset) {
    //标识当前进行的操作是从a[i][j]开始，以n为边长的方阵中，以offset为偏移填数
    if (n == 1) {
        a[i][j] = 1 + offset;
        return;
    }
        
    if (n == 2)
    {
        a[i][j] = 1 + offset; a[i][j + 1] = 2 + offset;
        a[i + 1][j] = 3 + offset; a[i + 1][j + 1] = 4 + offset;

        return;
    }
    //填写上面一行
    int k = 1;
    for (int p = j; p < j+n; p++) {
        a[i][p] = k + offset;
        k++;
    }
    //填写右边一列
    for (int p = i + 1; p < i + n; p++) {
        a[p][j + n - 1] = k + offset;
        k++;
    }
    //填写下边一行
    for (int p = j+n-2; p >= j; p--) {
        a[i + n - 1][p] = k + offset;
        k++;
    }
    //填写左边一列
    for (int p = i + n - 2; p > i; p--) {
        a[p][j] = k + offset;
        k++;
    }
    function(a, n - 2, i + 1, j + 1, a[i + 1][j]);
            
}