package com.fhj.test;
public class Main {
public static void main(String[] args) {
int num = 8;
diTui(num);//递推
System.out.println("-----------------------");
recursion(num);//递归
}
//递推
public static void diTui(int n) {
for (int i = 1; i <= n; i++) {
for (int j = 0; j < i; j++) {
System.out.print(i + " ");
}
System.out.println();
}
}
//递归
public static void recursion(int n) {
if (n == 0) return;
recursion(n - 1);
for (int i = 0; i < n; i++) {
System.out.print(n + " ");
}
System.out.println();
}
}