打印三角形

输入一个数　打印出类似三角形

package test;


import java.util.Scanner;


public class　 {
public final static int MAX = 20;//最大的数组长度
static int[][] array = new int[MAX][MAX];//最大的数组
static int t1, t2, a1, a2, b1, b2, len, result, h;
static Scanner scan = new Scanner(System.in);
public static void main(String[] args) {
System.out.println("input a number: ");
len = scan.nextInt();//三角形的边长
int[][] array = new int[MAX][MAX];
int[][] ary=fx(len);
for (int i = 1; i <=len+1; i++) {//输出三角形
for (int j = 1; j <=len+1-i; j++)
System.out.print("\t"+ary[i][j]);
System.out.println();
}
}
private static int[][] fx(int len) {// 1 7
int sum = 1;
result = (1 + len) * len / 2;// 三角形中的最大值
h = (len - 1) / 3 + 1;// 三角形的圈数
for (int i = 1; i <= h; i++) {//循环为三角形赋值
for (t1 = i, t2 = i; t2 <= len - 2 * i + 1; t2++) {//对横边进行赋值
array[t1][t2] = sum;
sum++;
}
for (a1 = i, a2 = len - 2 * i + 2; a1 <= len - 2 * i + 1; a1++, a2--) {//对斜边进行复制
if ((result==sum)&&(len%3==1))
break;
else {
array[a1][a2] = sum;
sum++;
}
}
for (b1 = len - 2 * (i - 1), b2 = i; b1 >= 1 + i; b1--) {//对竖边进行赋值
if ((result==sum)&&(len%3==1))
break;
else {
array[b1][b2] = sum;
sum++;
}
}
}
if(len%3==1){
array[h][h]=sum;//对边长为1,4,7,11,n=3*n+1的最后一个数组进行赋值
}
return array;
}
}