方法1
#include<stdio.h>
#include"stdafx.h"
#define N 10
int main()
{
int c=0,i=0,j=0,out=1,n,z;
int a[N][N]={0};/* 初始化下数组*/
printf("请输入数组维数:");
scanf("%d",&n);
z=n*n;
while(out<=z)
{
i=0; /*每轮后初始化下i,j */
j=0;
for(i+=c,j+=c;j<n-c;j++)
{if(out>z)break;a[i][j]=out++;}/* 从左至右的循环 */
for(j--,i=i+1;i<n-c;i++)
{if(out>z)break;a[i][j]=out++;}/* 从上至下的循环 */
for(i--,j=j-1;j>=c;j--)
{if(out>z)break;a[i][j]=out++;}/* 从右至左的循环 */
for(j++,i=i-1;i>c;i--)
{if(out>z)break;a[i][j]=out++;}/* 从下至上的循环 */
c++;
}
for(i=0;i<n;i++)
{
for(j=0;j<n;j++)
printf("%5d",a[i][j]);
printf("\n");
}
return 0;
}
方法1>
基本思想为:
1.填充矩阵的最外围,x方向从0开始,y方向从N-1开始;
2.内圈填充时,x轴+1,y轴-1;
#include "stdafx.h"
#include "stdio.h"
void main()
{
int N;
scanf("%d", &N);
int a[100][100];
int start = 0;
int end = N - 1;
int width = end - start;
int num = 1;
int i, j;
int x = 0;
while (end - start >= 0)
{
if (end - start == 0)
{
a[(N - 1) / 2][(N - 1) / 2] = N*N;//最中间的那个
break;
}
for (i = start; i<end; i++)
{
a[start][i] = num;
num++;
}
for (i = start; i<end; i++)
{
a[i][end] = num;
num++;
}
for (i = end; i>start; i--)
{
a[end][i] = num;
num++;
}
for (i = end; i>start; i--)
{
a[i][start] = num;
num++;
}
start++;
end--;
width = end - start;
}
for (i = 0; i<N; i++)
{
for (j = 0; j<N; j++)
printf("%6d", a[i][j]);
printf("\n");
}
}