ACM学习笔记———33蛇形填数

#include<stdio.h>
#include<string.h>
int a[100][100];
int main()
{
    int n,t=0,x,y;
    scanf("%d", &n);
    memset(a, 0, sizeof(a));
    t = a[x = 0][y = n - 1] = 1;
    while (t<n*n)
    {
        while (x + 1 < n && a[x+1][y] ==0)
        {
            a[++x][y] = ++t;
        }
        while (y-1>=0 && a[x][y-1] == 0)
        {
            a[x][--y] = ++t;
        }
        while (x-1>=0 && a[x-1][y] == 0)
        {
            a[--x][y] = ++t;
        }
        while (y+1<n && a[x][y+1] == 0)
        {
            a[x][++y] = ++t;
        }
    }
    for (x = 0; x < n;x++)
    {
        for (y = 0; y < n - 1;y++)
        {
            printf("%d ", a[x][y]);
        }
        printf("%d\n", a[x][n - 1]);
    }
}

题目所给的最优答案：

int main()
{
    int d[101][101];
    int n,a,b;
    int t = 1;
    scanf("%d", &n);
    for (a = 0; a <= (n - 1) / 2;a++)
    {
        for (b = a; b <= n - a - 1;b++)
        {
            d[b][n - a - 1] = t++;
        }
        for (b = n - a - 2; b >= a;b--)
        {
            d[n - a - 1][b] = t++;
        }
        for (b = n - a - 2; b >= a;b--)
        {
            d[b][a] = t++;
        }
        for (b = a + 1; b < n - a - 1;b++)
        {
            d[a][b] = t++;
        }
    }
    for (a = 0; a <= n - 1;a++)
    {
        for (b = 0; b <= n - 1;b++)
        {
            printf("%d ", d[a][b]);
        }
        printf("\n");
    }
}

第二个答案思想是，算出n阶方阵有多少“层”–a，n阶方阵就有（n-1）/2取整层（难），a=0时就是最外层，n-a-1就是最外层的“墙”，依次从外向里逆时针填数。
而相对于第二个答案，第一个答案思想较为简单，n阶方阵蛇形数最后填的数字肯定是n*n，所以以数字为循环条件，直到方阵中填入n *n停止。内层循环递增递减行和列，遇到已填说明本行或本列已填完，转入衔接的下一列或行。但是每次在内循环后都要判断t