题解 | #蛇形矩阵#
蛇形矩阵
https://www.nowcoder.com/practice/649b210ef44446e3b1cd1be6fa4cab5e
import java.lang.*;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
// 矩阵行列数据
int num = sc.nextInt();
// 第一层循环是行数
for (int i = 1; i < num + 1; i++) {
// 第二次循环是列数据
for (int j = 1; j < num + 2 - i; j++) {
System.out.print(getNum(i, j) + " ");
}
System.out.println();
}
}
public static int getNum(int line, int col) {
int start = getLineNum(line);
int end = start;
for (int i = 1; i < col; i++) {
end = end + (line + 1) + (col - i-1);
}
return end;
}
public static int getLineNum(int line) {
int start = 1;
for (int i = 0; i < line; i++) {
start += i;
}
return start;
}
}
#华为笔试#
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
// 矩阵行列数据
int num = sc.nextInt();
// 第一层循环是行数
for (int i = 1; i < num + 1; i++) {
// 第二次循环是列数据
for (int j = 1; j < num + 2 - i; j++) {
System.out.print(getNum(i, j) + " ");
}
System.out.println();
}
}
public static int getNum(int line, int col) {
int start = getLineNum(line);
int end = start;
for (int i = 1; i < col; i++) {
end = end + (line + 1) + (col - i-1);
}
return end;
}
public static int getLineNum(int line) {
int start = 1;
for (int i = 0; i < line; i++) {
start += i;
}
return start;
}
}
#华为笔试#