// 打印金字塔、空心金字塔、空心菱形
import java.util.Scanner;
public class MulForExercise{
public static void main(String[] args){
System.out.println("请输入层数:");
Scanner myScanner = new Scanner(System.in);
int layer = myScanner.nextInt();
System.out.println("Pyramid");
for(int i = 1; i <= layer; i++){
for(int j = 0; j < layer - i; j++){
System.out.print(' ');
}
for(int j = 0; j < 2 * i - 1; j++){
System.out.print('*');
}
System.out.print("\n");
}
//空心金字塔
System.out.println("hollow pyramid");
for(int i = 1; i < layer; i++){
for(int j = 0; j < layer - i; j++){
System.out.print(' ');
}
for(int j = 0; j < 2 * i - 1; j++){
if (j == 0 || j == 2 * i - 2){
System.out.print('*');
}else{
System.out.print(' ');
}
}
System.out.print("\n");
}
// 打印最后一层
for(int i = 0; i < 2 * layer - 1; i++)
System.out.print('*');
System.out.print("\n");
// 空心菱形
System.out.println("solid pyramid");
for(int i = 1; i <= layer; i++){
for(int j = 0; j < layer - i; j++){
System.out.print(' ');
}
for(int j = 0; j < 2 * i - 1; j++){
if (j == 0 || j == 2 * i - 2){
System.out.print('*');
}else{
System.out.print(' ');
}
}
System.out.print("\n");
}
for(int i = layer - 1; i > 0; i--){
for(int j = 0; j < layer - i; j++){
System.out.print(' ');
}
for(int j = 0; j < 2 * i - 1; j++){
if (j == 0 || j == 2 * i - 2){
System.out.print('*');
}else{
System.out.print(' ');
}
}
System.out.print("\n");
}
}
}
多重循环练习-金字塔(Java)
最新推荐文章于 2024-06-26 18:33:25 发布