分析:
int main()
{
int n = 0;
scanf("%d", &n);
//int arr[N][N] = { 0 }; //不需要数组
for (int i = 0; i < n; i++)
{
for (int j = 0; j < n; j++)
{
if (i == j || i + j == n-1)
{
printf("*");
}
else
{
printf(" ");
}
}
printf("\n");
}
return 0;
}