题解 | #回型矩阵#

#include <stdio.h>

int main()
{
	int n = 0;
	scanf("%d", &n);
	int i = 0, j = 0;
	int t = 1;
	int arr[19][19] = { 0 };

	/*while (j <= n )
	{
		
		
		j++;
	}
	printf("%d", j);*/
	arr[i][j] = t;
	while (t < n * n)
	{
		//往左
		while (j + 1 < n && arr[i][j + 1] == 0)
		{
			j++;
			t++;
			arr[i][j] = t;
		}
		while (i + 1 < n && arr[i + 1][j] == 0)
		{
			i++;
			t++;
			arr[i][j] = t;
		}
		while (j - 1>=0 && arr[i][j - 1] == 0)
		{
			j--;
			t++;
			arr[i][j] = t;
		}
		while (i-1 >= 0&&arr[i-1][j]==0)
		{
			i--;
			t++;
			arr[i][j] = t;
		}
	}
	for (int i = 0; i < n; i++)
	{
		for (int j = 0; j < n; j++)
		{
			printf("%d ", arr[i][j]);
		}
		printf("\n");
	}



	return 0;
	
}