1.蛇形矩阵
public static void printMatrix(int n) {
int[][] array = new int[n][n];
int count = 1;
for (int i = 0; i < 2 * n - 2; i++) {
for (int j = 0; j <= i; j++) {
int x = i - j;
if (x < n && j < n) {
if (i % 2 == 0) {
array[x][j] = count;
} else {
array[j][x] = count;
}
count++;
}
}
}
array[n - 1][n - 1] = count;
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
System.out.print(array[i][j] + " ");
}
System.out.println();
}
}
2.回型矩阵
public static void printMatrix(int n) {
int[][] array = new int[n][n];
int p = 0, q = n - 1, count = 1;
while (count <= n * n) {
for (int i = p; i <= q; i++)
array[p][i] = count++;
for (int i = p + 1; i <= q; i++)
array[i][q] = count++;
for (int i = q - 1; i >= p; i--)
array[q][i] = count++;
for (int i = q - 1; i >= p + 1; i--)
array[i][p] = count++;
p++;
q--;
}
for (int[] a : array) {
for (int i : a) System.out.print(i + " ");
System.out.println();
}
}
3.空心正方形
public static void printSquare(int n) {
for (int i = 1; i <= n; i++) {
if (i == 1 || i == n) {
for (int j = 1; j <= n; j++) {
System.out.print("* ");
}
System.out.println();
} else {
for (int j = 1; j <= n; j++) {
if (j == 1 || j == n) {
System.out.print("* ");
} else {
System.out.print(" ");
}
}
System.out.println();
}
}
}



