题目
给一个矩阵,将矩阵顺时针打印出来,如:
1 2 3 4
12 13 14 5
11 16 15 6
10 9 8 7
解答
主要是找规律,最大循环圈数为cycle= n/2 , 然后分别看上下左右 第一圈和第二圈的行走路径规律就行了,注意最后退出的条件可以是判断当前的点有没有设置非0值。
public class NishizhenPrintJuzhen {
public static int[][] getPrint(int n ){
int[][] result = new int[n][n];
int current = 0;
//cycle为总循环次数
for (int cycle = 0; cycle <= n / 2; cycle++) {
//往右填充
for (int right = cycle; right < n - cycle; right++) {
if (result[cycle][right] != 0) {
return result;
}
result[cycle][right] = current;
current++;
}
//往下填充
for (int down = cycle + 1; down < n - cycle; down++) {
if (result[down][n - cycle - 1] != 0) {
return result;
}
result[down][n - cycle - 1] = current;
current++;
}
//往左填充
for (int left = n - cycle - 2; left >= cycle; left--) {
if (result[n - cycle - 1][left] != 0) {
return result;
}
result[n - cycle - 1][left] = current;
current++;
}
//往上填充
for (int up = n - cycle - 2; up >= cycle + 1; up--) {
if (result[up][cycle] != 0) {
return result;
}
result[up][cycle] = current;
current++;
}
}
return result;
}
public static void main(String[] args) {
int n = 12;
int[][] result = getPrint(n);
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
System.out.print(result[i][j] + " ");
}
System.out.println();
}
}
}