import java.util.Scanner;
public class Main{
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
while(in.hasNext()){
int len = in.nextInt();
int N = len;
int[][] result = new int[N][N];
int i = 0;
int j = 0;
int col_low = 0;
int col_high = N-1;
int k = 0;
result[i][j] = ++k;
boolean flag = true;
while(N!=0){
if(flag){
for(j++;j<=col_high;j++){
result[col_low][j] = ++k;
}
j--;
for(i++;i<=col_high;i++){
result[i][col_high] = ++k;
}
i--;
}
else {
for(j--;j>=col_low;j--){
result[col_high][j] = ++k;
}
j++;
for(i--;i>col_low;i--){
result[i][col_low] = ++k;
}
i++;
col_high--;
col_low++;
}
flag = !flag;
N--;
}
for(int[] n:result){
for(int m:n){
System.out.print(m+" ");
}
}
}
in.close();
}
}
腾讯2016实习生编程题蛇形矩阵打印
最新推荐文章于 2023-11-11 19:05:23 发布