//适用数组存储
public class TriangleTest
int num = 5;
int MaxNum = 2*num-1;
String[][] storeT = new String[num][MaxNum];
int middleVal = (MaxNum-1)/2;
public void SetTriangle(){
//为数组元素赋值为“”空
for (int i = 0; i <num ;i++ )
{
for (int j =0 ; j <MaxNum; j++)
{
storeT[i][j]=" ";
}
}
//判断为*的数组位置
for (int i = 0;i <num; i++ ){
storeT[i][middleVal]= "*";
if (i>0)
{
for (int j = 1;j <i+1; j++ )
{
storeT[i][middleVal-j]= "*";
storeT[i][middleVal+j]= "*";
}
}
for (int t = 0; t<MaxNum ; t++)
{
System.out.print(storeT[i][t]+" ");
}
System.out.println();
}
}
public static void main(String[] args)
{
TriangleTest pr = new TriangleTest();
pr.SetTriangle();
}
}
//别人的方法
只是需要检测前面的空格的数量
public class TriangleTest{
public static void main(String[] args) {
int rows = 5;
for (int i = 1; i<= rows ;i++ )
{
for (int j = 1;j <= rows-i ; j++ )
{
System.out.print(" ");
}
for (int t = 1; t < 2*i ; t++)
{
System.out.print("* ");
}
System.out.print("\n");
}
}
}