螺旋数组实现

#include <iostream>  
using namespace std;

/*
1    2    3    4    5
16   17   18   19   6
15   24   25   20   7
14   23   22   21   8
13   12   11   10   9
*/
void Matrix(int **matrix, int n)
{
	int i = 0;
	int j = 0;
	int startNum = 1;
	if (n % 2 == 1)
		matrix[n / 2][n / 2] = n*n;
	if (n == 0)
		return;
	for (int k = n; k > 1; --k)
	{
		for (i = n - k, j = 0; i < k; ++i, ++j)
			matrix[n - k][i] = startNum + j;
		for (i = n - k, j = 0; i < k; ++i, ++j)
			matrix[i][k - 1] = matrix[n - k][k - 1] + j;
		for (i = k - 1, j = 0; i >= n - k; --i, j++)
			matrix[k - 1][i] = matrix[k - 1][k - 1] + j;
		for (i = k - 1, j = 0; i > n - k; --i, j++)
			matrix[i][n - k] = matrix[k - 1][n - k] + j;
		startNum = matrix[i + 1][n - k] + 1;
	}
}
int main(void)
{
	int n;
	cin >> n;
	int **matrix = new int*[n];
	for (int i = 0; i < n; i++)
		matrix[i] = new int[n];
	Matrix(matrix, n);
	for (int i = 0; i < n; ++i)
		for (int j = 0; j < n; ++j)
		{
			if (j % n == 0)
				cout << endl;
			cout << matrix[i][j] << "\t";
		}
	for (int i = 0; i < n; i++)
		delete[]matrix[i];
	delete[] matrix;
	cout << endl;
	system("pause");
	return 0;
}