题解HJ35 | #蛇形矩阵#
蛇形矩阵
https://www.nowcoder.com/practice/649b210ef44446e3b1cd1be6fa4cab5e
import java.util.Scanner;
// 注意类名必须为 Main, 不要有任何 package xxx 信息
public class Main {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
int n = in.nextInt();
int[][] arr = new int[n][n];
int count = 1;
for (int i = 0; i < n; i++) {
for (int j = 0; j <= i; j++) {
arr[i][j] = count++;
}
}
//列
int rank = 0;
//行
int row = 0;
while (true) {
System.out.print(arr[row][rank] + " ");
rank++;
row++;
if (row == n && rank == 1) break;
if (row >= n) {
System.out.print("\n");
row = n - rank + 1;
rank = 0;
}
}
}
}
用最笨的办法 先输入一个数组 然后想办法修改打印路径
