#include <stdio.h>
int main(){
int n=4;
int a[4][4] = {{1,2,3,4},{4,5,6,7},{7,8,9,10},{11,12,13,14}};
int i = 0;
int j = 0;
for ( i=0; i< n; i ++){
for(j = 0; j < n;j++){
printf("%d ", a[i][j]);
}
printf("\n");
}
int k =0;
i = j = 0;
printf("\n");
int ul = 0;
int ur = n;
while( k < 2){
for(; j < (n-k) ;j++){
printf("行a[%d][%d] %d ",i,j, a[i][j]);
}
j-=1;
// printf("\n %d %d \n", a[1][2],a[2][2]);
i = i+1;
// j = j;
for (; i < (n-k); i++){
printf("列a[%d][%d] %d ",i,j, a[i][j]);
}
i-=1;
//j = j - 1;
j-=1;
for(; j >= k; j--){
printf("底行%d ", a[i][j]);
}
j+=1;
//j+=1;
i = i - 1;
for( ; i > k; i--){
printf("左列%d ", a[i][j]);
}
i+=1;
j+=1;
k = k+1;
}
}
转载于:https://my.oschina.net/innovation/blog/3073119