问题描述
回形取数就是沿矩阵的边取数,若当前方向上无数可取或已经取过,则左转90度。一开始位于矩阵左上角,方向向下。
输入格式
输入第一行是两个不超过200的正整数m, n,表示矩阵的行和列。接下来m行每行n个整数,表示这个矩阵。
输出格式
输出只有一行,共mn个数,为输入矩阵回形取数得到的结果。数之间用一个空格分隔,行末不要有多余的空格。
样例输入
3 3
1 2 3
4 5 6
7 8 9
样例输出
1 4 7 8 9 6 3 2 5
样例输入
3 2
1 2
3 4
5 6
样例输出
1 3 5 6 4 2
#include"stdio.h"
#include"math.h"
int main()
{
int row,col,x,y,k,z,anglePoint,init = 1; //先定义个二维数组
int left,bottom,top,right;
int i,j;
int start;
scanf("%d",&row);
scanf("%d",&col);
int TwoArray[row][col];
for(x = 0;x<row;x++){
for(y = 0;y<col;y++){
TwoArray[x][y] = init;
init++;
}
} //<-到这里定义完成
printf("%d%d\n",row,col);
for(k = 0;k<row;k++){
for(z = 0;z<col;z++){
printf("%d ",TwoArray[k][z]);
}
}
printf("\n");
for(left = 0;left<row;left++){
printf("%d ",TwoArray[left][0]);
}
printf("\n");
if(row==1){
for(start = 0;start < col ;start++){
printf("%d ",TwoArray[0][start]);
}
}else if(col==1){
for(start = 0;start < row ;start++){
printf("%d ",TwoArray[start][0]);
}
}else{
int max;
if(row < col){
max = (int)row/2;
}
max = (int)col/2;
for(anglePoint=0;anglePoint<max;anglePoint++){ //最外层循环用来改变回形起点
int left,bottom,top,right;
for(left = anglePoint;left<row-(anglePoint*2);left++){ //以下分别是上左下右的边
printf("%d ",TwoArray[left][anglePoint]);
}
for(bottom = anglePoint+1;bottom<col-(anglePoint*2);bottom++){
printf("%d ",TwoArray[row-anglePoint-1][bottom]);
}
for(right = row-anglePoint-2;right!=anglePoint;right--){
printf("%d ",TwoArray[right][col-anglePoint-1]);
}
for(top = col-anglePoint-1;top != anglePoint;top--){
printf("%d ",TwoArray[anglePoint][top]);
}
if(row<col){
j = (int)row/2;
for(i=0;i<=col-row;i++){
printf("%d ",TwoArray[(int)(row/2)][j]);
j++;
}
}else if(row == col&&row%2 != 0){
j = (int)(row/2);
printf("%d",TwoArray[j][j]);
}else if(row>col&&col%2 != 0){
j = (int)col/2;
for(i=0;i<=row-col;i++){
printf("%d ",TwoArray[j][(int)(col/2)]);
j++;
}
}
continue;
}
}
}