什么是Floyd Triangle?
佛洛依德三角是直角三角型自然数数组。用连续的数字填充三角形的每一行。以1开头填充在直角三角形最上部。
思路:
第n行有n个连续的自然数,这个还是比较简单的。
实现:
import java.util.Scanner;
public class Test {
public static void main(String[] args) {
TestPrintFloydTriangle();
}
public static void TestPrintFloydTriangle() {
System.out.println("Please enter the number of rows: ");
Scanner in = new Scanner(System.in);
int rowNum = in.nextInt();
System.out.println("Print Floyd Triangle of rows " + rowNum + "");
printFloydTriangle(rowNum);
}
public static void printFloydTriangle(int rowNum) {
int filling = 1;
for (int i = 1; i <= rowNum; i++) {
for (int j = 1; j <= i; j++) {
System.out.print(filling);
System.out.print(" ");
filling++;
}
System.out.println();
}
}
}
结果:
Please enter the number of rows:
8
Print Floyd Triangle of rows 8
1
2 3
4 5 6
7 8 9 10
11 12 13 14 15
16 17 18 19 20 21
22 23 24 25 26 27 28
29 30 31 32 33 34 35 36
Process finished with exit code 0