输出螺旋数组（难度：1颗星）

心已赠人 2022-06-16 09:23 241阅读 0赞

输入n\*n矩阵的n值，打印出一个螺旋矩阵，如下面例子：

当n= 5时，输出

1    2    3    4    5
       16   17   18   19    6
       15   24   25   20    7
       14   23   22   21    8
       13   12   11   10    9

方法1：  
用静态的二维数组保存，到方法2在动态生成，随着n的变化而变化，根据右，下，左，上的顺序，就可以走出一个螺旋数组。

参考代码：

#include <stdio.h>
    
    int arr[100][100], n;//暂时先用静态的二维数组保存，到方法2在动态生成，随着n的变化而变化
    
    enum EmDir
    {
        emRight = 1,
        emDown = 2,
        emLeft = 3,
        emUp = 4,
    };
    
    int IsRightDirOk(int row, int column)
    {
        return (column + 1 < n && 0 == arr[row][column + 1]);
    }
    
    int IsDownDirOk(int row, int column)
    {
        return (row + 1 < n && 0 == arr[row + 1][column]);
    }
    
    int IsLeftDirOk(int row, int column)
    {
        return (column - 1 >= 0 && 0 == arr[row][column - 1]);
    }
    
    int IsUpDirOk(int row, int column)
    {
        return (row - 1 >= 0 && 0 == arr[row - 1][column]);
    }
    
    int GetNextStepDir(int curDir, int row, int column)
    {
        if (curDir == emRight)
            return IsRightDirOk(row, column) ? emRight : emDown;
        else if (curDir == emDown)
            return IsDownDirOk(row, column) ? emDown : emLeft;
        else if (curDir == emLeft)
            return IsLeftDirOk(row, column) ? emLeft : emUp;
        return IsUpDirOk(row, column) ? emUp : emRight;
    }
    
    int main()
    {
        int i, j, row = 0, column = 0, nCount = 1, curDir = (int)emRight;
        printf("输入n*n矩阵的n值：");
        scanf_s("%d", &n);
        while (nCount <= n * n)
        {
            arr[row][column] = nCount++;
            curDir = GetNextStepDir(curDir, row, column);
            if (emRight == curDir)
                column++;
            else if (emDown == curDir)
                row++;
            else if (emLeft == curDir)
                column--;
            else
                row--;
        }
        for (i = 0; i < n; i++)
        {
            for (j = 0; j < n; j++)
                printf("%5d", arr[i][j]);
            printf("\n");
        }
        return 0;
    }

方法2：  
与方法1一样，只是为了适应变化的n值，采用了动态分配二维数组的空间。

参考代码：

#include <stdio.h>
    #include <malloc.h>
    #include <memory.h>
    
    int **pArray, n;//用一个二级指针来索引二维数组中的元素
    
    enum EmDir
    {
        emRight = 1,
        emDown = 2,
        emLeft = 3,
        emUp = 4,
    };
    
    int IsRightDirOk(int row, int column)
    {
        return (column + 1 < n && 0 == pArray[row][column + 1]);
    }
    
    int IsDownDirOk(int row, int column)
    {
        return (row + 1 < n && 0 == pArray[row + 1][column]);
    }
    
    int IsLeftDirOk(int row, int column)
    {
        return (column - 1 >= 0 && 0 == pArray[row][column - 1]);
    }
    
    int IsUpDirOk(int row, int column)
    {
        return (row - 1 >= 0 && 0 == pArray[row - 1][column]);
    }
    
    int GetNextStepDir(int curDir, int row, int column)
    {
        if (curDir == emRight)
            return IsRightDirOk(row, column) ? emRight : emDown;
        else if (curDir == emDown)
            return IsDownDirOk(row, column) ? emDown : emLeft;
        else if (curDir == emLeft)
            return IsLeftDirOk(row, column) ? emLeft : emUp;
        return IsUpDirOk(row, column) ? emUp : emRight;
    }
    
    int main()
    {
        int i, j, row = 0, column = 0, nCount = 1, curDir = (int)emRight;
        printf("输入n*n矩阵的n值：");
        scanf_s("%d", &n);
        pArray = (int**)malloc(n * sizeof(int*));//生成n个指针，然后让每个指针指向一段连续的大小为n * sizeof(int)的空间
        for (i = 0; i < n; i++)
            pArray[i] = (int*)malloc(n * sizeof(int));
    
        for (i = 0; i < n; i++)
            for (j = 0; j < n; j++)
                pArray[i][j] = 0;//初始化二维数组
    
        while (nCount <= n * n)
        {
            pArray[row][column] = nCount++;
            curDir = GetNextStepDir(curDir, row, column);
            if (emRight == curDir)
                column++;
            else if (emDown == curDir)
                row++;
            else if (emLeft == curDir)
                column--;
            else
                row--;
        }
        for (i = 0; i < n; i++)
        {
            for (j = 0; j < n; j++)
                printf("%5d", pArray[i][j]);
            printf("\n");
        }
    
        for (i = 0; i < n; i++)
            free(pArray[i]);
        free(pArray);
        return 0;
    }

方法3：  
根据规律，打印螺旋矩形的时候，每走一圈，上下左右就分别往里面缩小了1。

参考代码：

#include <stdio.h>
    #include <malloc.h>
    #include <memory.h>
    
    int **pArray, n;//用一个二级指针来索引二维数组中的元素
    
    int main()
    {
        int i, j, nCount = 1;
        printf("输入n*n矩阵的n值：");
        scanf_s("%d", &n);
        pArray = (int**)malloc(n * sizeof(int*));//生成n个指针，然后让每个指针指向一段连续的大小为n*sizeof(int)的空间
        for (i = 0; i < n; i++)
            pArray[i] = (int*)malloc(n * sizeof(int));
    
        for (i = 0; i < n; i++)
            for (j = 0; j < n; j++)
                pArray[i][j] = 0;//初始化二维数组
    
        for (i = 0; i <= n / 2; i++)
        {
            for (j = 0; j < n - i; j++)
                if (0 == pArray[i][j])
                    pArray[i][j] = nCount++;
    
            for (j = i + 1; j < n - i; j++)
                if (0 == pArray[j][n - i - 1])
                    pArray[j][n - i - 1] = nCount++;
    
            for (j = n - i - 1; j > i; j--)
                if (0 == pArray[n - i - 1][j])
                    pArray[n - i - 1][j] = nCount++;
    
            for (j = n - i - 1; j > i; j--)
            {
                if (0 == pArray[j][i])
                    pArray[j][i] = nCount++;
            }
        }
    
        for (i = 0; i < n; i++)
        {
            for (j = 0; j < n; j++)
                printf("%5d", pArray[i][j]);
            printf("\n");
        }
    
        for (i = 0; i < n; i++)
            free(pArray[i]);
        free(pArray);
        return 0;
    }

方法4：  
不利用数组是否为0来进行判断，而是用了4个变量来保存4个边界。

参考代码：

#include <stdio.h>
    #include <malloc.h>
    #include <memory.h>
    
    #define DIR_RIGHT 0
    #define DIR_DOWN 1
    #define DIR_LEFT 2
    #define DIR_UP 3
    
    int **pArray, n;//用一个二级指针来索引二维数组中的元素
    
    int main()
    {
        int i, j, row = 0, column = 0, nCount = 1, nRightBound, nLeftBound, nUpBound, nDownBound, CurDir = DIR_RIGHT;
        printf("输入n*n矩阵的n值：");
        scanf_s("%d", &n);
        nRightBound = nDownBound = n - 1;
        nLeftBound = 0;
        nUpBound = 1;//上边界的初始值要设为1，因为第一次走到的时候，已经走完一圈了
        pArray = (int**)malloc(n * sizeof(int*));//生成n个指针，然后让每个指针指向一段连续的大小为n*sizeof(int)的空间
        for (i = 0; i < n; i++)
            pArray[i] = (int*)malloc(n * sizeof(int));
    
        pArray[0][0] = nCount++;
        while (nCount <= n * n)
        {
            if (DIR_RIGHT == CurDir)
            {
                if (column + 1 <= nRightBound)
                    pArray[row][++column] = nCount++;
                else
                {
                    CurDir = (CurDir + 1) % 4;
                    nRightBound--;
                }
            }
            else if (DIR_DOWN == CurDir)
            {
                if (row + 1 <= nDownBound)
                    pArray[++row][column] = nCount++;
                else
                {
                    CurDir = (CurDir + 1) % 4;
                    nDownBound--;
                }
            }
            else if (DIR_LEFT == CurDir)
            {
                if (column - 1 >= nLeftBound)
                    pArray[row][--column] = nCount++;
                else
                {
                    CurDir = (CurDir + 1) % 4;
                    nLeftBound++;
                }
            }
            else
            {
                if (row - 1 >= nUpBound)
                    pArray[--row][column] = nCount++;
                else
                {
                    CurDir = (CurDir + 1) % 4;
                    nUpBound++;
                }
            }
        }
    
        for (i = 0; i < n; i++)
        {
            for (j = 0; j < n; j++)
                printf("%5d", pArray[i][j]);
            printf("\n");
        }
    
        for (i = 0; i < n; i++)
            free(pArray[i]);
        free(pArray);
        return 0;
    }

方法5：  
和方法4的区别在于，不再使用二维数组，而是直接利用光标的位置来进行打印。

#include <stdio.h>
    #include <Windows.h>
    
    #define DIR_RIGHT 0
    #define DIR_DOWN 1
    #define DIR_LEFT 2
    #define DIR_UP 3
    
    void setcursor(int x,int y)
    {
        HANDLE hCon=GetStdHandle(STD_OUTPUT_HANDLE);
        COORD setps;
        setps.X=x; setps.Y=y;
        SetConsoleCursorPosition(hCon,setps);
    }
    
    int main()
    {
       //思路：不用数组，采用控制光标的方式输出
        int n, row = 0, column = 0, nCount = 1, nRightBound, nLeftBound, nUpBound, nDownBound, CurDir = DIR_RIGHT;
        printf("输入n*n矩阵的n值：");
        scanf_s("%d", &n);
        nRightBound = nDownBound = n - 1;
        nLeftBound = 0;
        nUpBound = 1;//上边界的初始值要设为1，因为第一次走到的时候，已经走完一圈了
    
        printf("%5d", nCount++);
        while (nCount <= n * n)
        {
            if (DIR_RIGHT == CurDir)
            {
                if (column + 1 <= nRightBound)
                {
                    column++;
                    setcursor(5 * column, 1 + row);
                    printf("%5d", nCount++);
                }
                else
                {
                    CurDir = (CurDir + 1) % 4;
                    nRightBound--;
                }
            }
            else if (DIR_DOWN == CurDir)
            {
                if (row + 1 <= nDownBound)
                {
                    row++;
                    setcursor(5 * column, 1 + row);
                    printf("%5d", nCount++);
                }
                else
                {
                    CurDir = (CurDir + 1) % 4;
                    nDownBound--;
                }
            }
            else if (DIR_LEFT == CurDir)
            {
                if (column - 1 >= nLeftBound)
                {
                    column--;
                    setcursor(5 * column, 1 + row);
                    printf("%5d", nCount++);
                }
                else
                {
                    CurDir = (CurDir + 1) % 4;
                    nLeftBound++;
                }
            }
            else
            {
                if (row - 1 >= nUpBound)
                {
                    row--;
                    setcursor(5 * column, 1 + row);
                    printf("%5d", nCount++);
                }
                else
                {
                    CurDir = (CurDir + 1) % 4;
                    nUpBound++;
                }
            }
        }
        setcursor(0, n);
        printf("\n");
    
        return 0;
    }

运行结果：

![这里写图片描述][SouthEast]

[SouthEast]: /images/20220616/35839e9788894efe8cb5d9a07fbd3733.png