螺旋数组

#define INDEX(total, x, y) ((x)*(total*2)+(y))
 
void fill(int *matrix, int total, int value)
{
    if(value < 0)
    {
        matrix[INDEX(total, total, total)] = 0;
        return;
    }
 
    int x_top = total - value;
    int y_left = x_top;
    int x_bottom = 2*total - x_top;
    int y_right = x_bottom;
 
    int x = 0;
    int y = 0;
 
    //(x_top, y_left) ---------> (x_top, y_right)           y changes
    for( x=x_top, y=y_left; y<y_right; y++)
        matrix[INDEX(total, x, y)] = value;
 
    //(x_top,y_right) ---------> (x_bottom, y_right)        x changes
    for( x=x_top, y=y_right; x<x_bottom; x++)
        matrix[INDEX(total, x, y)] = value;
 
    //(x_bottom, y_right) -----> (x_bottom, y_left)         y changes
    for( x=x_bottom, y=y_right; y>y_left; y--)
        matrix[INDEX(total, x, y)] = value;
 
    //(x_bottom, y_left) ------> (x_top, y_left)            x changes
    for( x=x_bottom, y=y_left; x>x_top; x--)
        matrix[INDEX(total, x, y)] = value;
 
    fill(matrix, total, value - 1);
}
 
void fill1(int *matrix, int total, int value)
{
BEGIN:
    if(value < 0)
    {
        matrix[INDEX(total, total, total)] = 0;
        return;
    }
 
    int x_top = total - value;
    int y_left = x_top;
    int x_bottom = 2*total - x_top;
    int y_right = x_bottom;
 
    int x = 0;
    int y = 0;
 
    //(x_top, y_left) ---------> (x_top, y_right)           y changes
    for( x=x_top, y=y_left; y<y_right; y++)
        matrix[INDEX(total, x, y)] = value;
 
    //(x_top,y_right) ---------> (x_bottom, y_right)        x changes
    for( x=x_top, y=y_right; x<x_bottom; x++)
        matrix[INDEX(total, x, y)] = value;
 
    //(x_bottom, y_right) -----> (x_bottom, y_left)         y changes
    for( x=x_bottom, y=y_right; y>y_left; y--)
        matrix[INDEX(total, x, y)] = value;
 
    //(x_bottom, y_left) ------> (x_top, y_left)            x changes
    for( x=x_bottom, y=y_left; x>x_top; x--)
        matrix[INDEX(total, x, y)] = value;
 
    value --;
    goto BEGIN;
}
 
void print(int *matrix, int total)
{
    int x = 0;
    int y = 0;
    int width = 3;
    for(x=0; x<=total*2; x++)
    {
        for(y=0; y<=total*2; y++)
            printf("%d\t", matrix[INDEX(total, x, y)]);
 
        printf("\n");
    }
}
 
int main(int argc, char* argv[])
{
    int total = atoi(argv[1]);
    int *matrix = (int *) malloc ((total*2+1)*(total*2+1)*sizeof(int));
    if(matrix == NULL) 
    {
        printf("error: malloc return NULL\n");
        return 1;
    }
 
    fill1(matrix, total, total);
    print(matrix, total);
 
    free(matrix);
    return 0;
}