清华大佬耗费三个月吐血整理的几百G的资源,免费分享!....>>>
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 | #include<stdio.h> #include<stdlib.h> void printMatrix( int **matrix, int columns, int rows, int start) { int x=columns-start-1; int y=rows-start-1; int i; for (i=start;i<=x;i++) //先打印一行 printf ( "%d " ,matrix[start][i]); if (start<y) //从上往下 { for (i=start+1;i<=y;i++) printf ( "%d " ,matrix[i][x]); } if (x>start&&y>start) //从右到左打印 { for (i=x-1;i>=start;i--) printf ( "%d " ,matrix[y][i]); } if (x>start&&y>start+1) //从下到上打印 { for (i=y-1;i>=start+1;i--) printf ( "%d " ,matrix[i][start]); } } void matrixClock( int **matrix, int columns, int rows) { if (matrix==NULL||columns<=0||rows<=0) return ; int start=0; while (columns>start*2&&rows>start*2) { printMatrix(matrix,columns,rows,start); start++; } } int main() { int n,m; while ( scanf ( "%d %d" ,&n,&m)!=NULL) { int **numbers; int i,j; numbers=( int **) malloc ( sizeof ( int *)*n); //n rows for (i=0;i<n;i++) numbers[i]=( int *) malloc ( sizeof ( int )*m); //m columns for (i=0;i<n;i++) for (j=0;j<m;j++) scanf ( "%d" ,&numbers[i][j]); matrixClock(numbers,m,n); } return 0; } |