蛇行填数

#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define maxn 20
int a[maxn][maxn];
int main()
{
    memset(a, 0, sizeof(a));
    int x, y, n, tot = 0;
    scanf("%d", &n);
    x = 0;y = n - 1;
    a[x][y] = tot = 1;
    while(tot < n*n)
    {
        while(x+1 < n && !a[x+1][y])
            a[++x][y] = ++tot;
        while(y-1 >= 0 && !a[x][y-1])
            a[x][--y] = ++tot;
        while(x-1 >= 0 && !a[x-1][y])
            a[--x][y] = ++tot;
        while(y+1 < n && !a[x][y+1])
            a[x][++y] = ++tot;
    }
    for(x = 0; x < n; x++)
    {
        for(y = 0; y < n; y++)
        {
            printf("%3d", a[x][y]);
        }
        printf("\n");
    }
    return 0;
}

算法入门经典例题

猜你喜欢

转载自blog.csdn.net/daijiuqian/article/details/86487069