代码:
package ls;
import java.util.Scanner;
public class sanjiao {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
System.out.println("请输入行数:");
int k = sc.nextInt();
int n = 1, w, m;
for (int i = 1; i <= k; i++) {
n += i - 1;
m = i + 1;
w = n;
for (int j = 1; j <= k + 1 - i; j++) {
System.out.printf("%-4d", w);
w += m++;
}
System.out.println();
}
}
}
运行:
要点: 输出了[i,j]位置后,输出[i-1,j+1],如果i=0,回到初始i位置,并且i+1、j=0。