思路:记录之前二维数组每个位点的xy坐标,判断得出当前坐标位置
对2到n*n依次判断,覆盖上一个xy坐标并记录当前坐标的值
两个bug:
其一:
int y0 = 1;
int x0 = (n + 1) / 2;应该在for循环外定义,否则每次值会重新初始化,而不是保存下来
其二:if判断完continue,防止满足多个,幻方内一个数字出现多次
for (int k= 2; k<= n * n; k++)
{
int y0 = 1;//错误:放在for外
int x0 = (n + 1) / 2;//错误:放在for外
if (y0 == 1 && x0 != n)//first
{
a[n][x0 + 1] = k;
y0 = n;
x0 = x0 + 1;
//错误:缺少continue;
}
}
//ac代码
#include<iostream>
using namespace std;
int a[40][40];
int main()
{
int n;
cin >> n;
a[1][(n + 1) / 2] = 1;
int y0 = 1;
int x0 = (n + 1) / 2;
for (int k = 2; k <= n * n; k++)
{
if (y0 == 1 && x0 != n)//first
{
a[n][x0 + 1] = k;
y0 = n;
x0 = x0 + 1;
continue;
}
if (x0 == n && y0 != 1)//second
{
a[y0 - 1][1] = k;
y0 -= 1;
x0 = 1;
continue;
}
if (y0 == 1 && x0 == n)//third
{
a[y0 + 1][x0] = k;
y0 += 1;
continue;
}
if (x0 != n && y0 != 1)//forth
{
if (a[y0 - 1][x0 + 1] == 0)
{
a[y0 - 1][x0 + 1] = k;
y0 -= 1;
x0 += 1;
continue;
}
else
{
a[y0 + 1][x0] = k;
y0 += 1;
continue;
}
}
}
for (int i = 1; i <= n; i++)
{
for (int j = 1; j <= n; j++)
{
cout << a[i][j] << " ";
}
cout << endl;
}
}