AcWing 754. 平方矩阵 II
原题链接
简单
import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
while (true){
int n = scanner.nextInt();
if(n == 0){
break;
}
int[][] arr = new int[n][n];
for (int i = 0; i < n ; i++) {
for (int j = 0; j < n ; j++) {
if( i + j < n){
arr[i][i+j] = j+1;
arr[i+j][i] = j+1;
}
}
}
//输出
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
System.out.print(arr[i][j]+" ");
}
System.out.println();
}
System.out.println();
}
}
}