AcWing 754. 平方矩阵 II--Java
原题链接
简单
作者:
Jiang锋时刻
,
2021-01-31 21:29:07
,
所有人可见
,
阅读 267
Java 代码
import java.util.*;
import java.io.*;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int num = sc.nextInt();
int[][] res;
while(num != 0) {
res = new int[num][num];
for(int i = 0; i < num; i++) {
res[i][i] = 1;
}
for(int i = 0; i < num - 1; i++) {
for(int j = i + 1; j < num; j++) {
res[i][j] = res[i][j - 1] + 1;
}
}
for(int j = 0; j < num - 1; j++) {
for(int i = j + 1; i < num; i++) {
if(res[i][j] == 0) {
res[i][j] = res[i - 1][j] + 1;
}
}
}
for(int i = 0; i < num; i++) {
for(int j = 0; j < num; j++) {
System.out.print(res[i][j] + " ");
}
System.out.println();
}
System.out.println();
num = sc.nextInt();
}
}
}