题解 | #蛇形矩阵#

#include <stdio.h>

int main()
{
	int n = 0;
	scanf("%d", &n);
	int t = 1;
	int arr[1000][1000] = { 0 };
	arr[1][1] = 1;
	int i = 1, j = 1;
	while (t < n * n)
	{
		if (j + 1 <= n)
		{
			j++;
			t++;
			arr[i][j] = t;

		}
		else
		{
			i++;
			t++;
			arr[i][j] = t;
		}
		while (j - 1 >0 && i + 1 <= n)
		{
			j--;
			i++;
			t++;
			arr[i][j] = t;
		}
		if (i + 1 <= n)
		{
			i++;
			t++;
			arr[i][j] = t;
		}
		else
		{
			j++;
			t++;
			arr[i][j] = t;
		}
		while (j + 1 <= n && i - 1 >0)
		{
			j++;
			i--;
			t++;
			arr[i][j] = t;
		}

	}
	for (int i = 1; i <=n; i++)
			{
		for (int j = 1; j <= n; j++)
		{
			printf("%d ", arr[i][j]);
		}
		printf("\n");
			}

	return 0;
}