1490 数据结构：螺旋方阵

#include <iostream>
#define MAX_SIZE 100+1
using namespace std; 5 int array[MAX_SIZE][MAX_SIZE];
int creatScrewMatrix(int n)
{
    int upBound=0,downBound=n-1,leftBound=0,rightBound=n-1;//上下左右边界初始化
    int num=1;
    while(upBound<=downBound && leftBound<=rightBound)
    {
        for (int i = leftBound; i <=rightBound; ++i)
            array[upBound][i]=num++;
        for (int i = ++upBound; i <=downBound; ++i)
            array[i][rightBound]=num++;
        for (int i = --rightBound; i >= leftBound; --i)
            array[downBound][i]=num++;
        for (int i = --downBound; i >=upBound; --i)
            array[i][leftBound]=num++;
        leftBound++;
    }
}
void printScrewMatrix(int n)
{
    for (int i = 0; i < n; ++i)
    {
        for (int j = 0; j < n; ++j)
            j==0?printf("%d",array[i][j]) : printf(" %d",array[i][j]);
        printf("
");
    }
    printf("
");
}
int main(int argc, char const *argv[])
{
    #ifndef _OJ_  //ONLINE_JUDGE
    freopen("input.txt", "r", stdin);
    #endif
    int n;
    scanf("%d",&n);
    creatScrewMatrix(n);
    printScrewMatrix(n);
    return 0;
}