打印空心倒置星形金字塔的Java程序

编写一个Java程序，使用for循环来打印空心倒置的星形金字塔图案。这个Java倒金字塔图案的例子在一个嵌套的for循环中使用if条件来识别边缘并显示空心的倒金字塔。

package ShapePrograms;

import java.util.Scanner;

public class HollowInvertedPyramid1 { private static Scanner sc;

public static void main(String\[\] args) {
	sc = new Scanner(System.in);
	
	System.out.print("Enter Hollow Inverted Pyramid Pattern Rows = ");
	int rows = sc.nextInt();
	
	System.out.println("Hollow Inverted Pyramid Star Pattern");
	
	for (int i = rows ; i > 0; i-- ) 
	{
		for (int j = 1 ; j <= rows - i; j++ ) 
		{
			System.out.print(" ");
		}
		for (int k = 1 ; k <= (2 \* i) - 1; k++ ) 
		{
			if(i == 1 || i == rows || k == 1 || k == (2 \* i) - 1)
			{
				System.out.print("\*");
			}
			else
			{
				System.out.print(" ");
			}
			
		}
		System.out.println();
	}
}

在这个Java空心倒星金字塔程序中，我们用while循环代替了for循环。

package ShapePrograms;

import java.util.Scanner;

public class HollowInvertedPyramid2 { private static Scanner sc;

public static void main(String\[\] args) {
	sc = new Scanner(System.in);
	
	System.out.print("Enter Hollow Inverted Pyramid Pattern Rows = ");
	int rows = sc.nextInt();
	
	System.out.println("Hollow Inverted Pyramid Star Pattern");
	int i = rows, j, k;
	
	while( i > 0) 
	{
		j = 1 ;
		while(j <= rows - i ) 
		{
			System.out.print(" ");
			j++;
		}
		k = 1 ;
		while(k <= (2 \* i) - 1 ) 
		{
			if(i == 1 || i == rows || k == 1 || k == (2 \* i) - 1)
			{
				System.out.print("\*");
			}
			else
			{
				System.out.print(" ");
			}		
			k++;
		}
		System.out.println();
		i-- ;
	}
}

Enter Hollow Inverted Pyramid Pattern Rows = 9
Hollow Inverted Pyramid Star Pattern
*****************
 *             *
  *           *
   *         *
    *       *
     *     *
      *   *
       * *
        *

使用do while循环打印空心倒置星形金字塔的Java程序

package ShapePrograms;

import java.util.Scanner;

public class HollowInvertedPyramid3 { private static Scanner sc;

public static void main(String[] args) { sc = new Scanner(System.in);

System.out.print("Enter Hollow Inverted Pyramid Pattern Rows = ");
int rows = sc.nextInt();

System.out.println("Hollow Inverted Pyramid Star Pattern");
int i = rows, j, k;	
do
{
	j = 1 ;
	do
	{
		System.out.print(" ");
	} while(j++ <= rows - i ) ;
	k = 1 ;
	do
	{
		if(i == 1 || i == rows || k == 1 || k == (2 \* i) - 1)
		{
			System.out.print("\*");
		}
		else
		{
			System.out.print(" ");
		}		
	} while(++k <= (2 \* i) - 1 ) ;
	System.out.println();
} while( --i > 0) ;

}

 

```markdown
Enter Hollow Inverted Pyramid Pattern Rows = 13
Hollow Inverted Pyramid Star Pattern
 *************************
  *                     *
   *                   *
    *                 *
     *               *
      *             *
       *           *
        *         *
         *       *
          *     *
           *   *
            * *
             *

在这个Java例子中，HollowInvertedPyramidPat函数打印了一个给定符号的空心倒金字塔图案。

package ShapePrograms;

import java.util.Scanner;

public class HollowInvertedPyramid4 { private static Scanner sc;

public static void main(String\[\] args) {
	sc = new Scanner(System.in);
	
	System.out.print("Enter Hollow Inverted Pyramid Pattern Rows = ");
	int rows = sc.nextInt();
	
	System.out.print("Enter Character for Exponentially Increased Pattern = ");
	char ch = sc.next().charAt(0);
	
	System.out.println("Hollow Inverted Pyramid Star Pattern");
	HollowInvertedPyramidPat(rows, ch);		
}

public static void HollowInvertedPyramidPat(int rows, char ch) {
	for (int i = rows ; i > 0; i-- ) 
	{
		for (int j = 1 ; j <= rows - i; j++ ) 
		{
			System.out.print(" ");
		}
		for (int k = 1 ; k <= (2 \* i) - 1; k++ ) 
		{
			if(i == 1 || i == rows || k == 1 || k == (2 \* i) - 1)
			{
				System.out.print(ch);
			}
			else
			{
				System.out.print(" ");
			}			
		}
		System.out.println();
	}
}

Enter Hollow Inverted Pyramid Pattern Rows = 17
Enter Character for Exponentially Increased Pattern = #
Hollow Inverted Pyramid Star Pattern
#################################
 #                             #
  #                           #
   #                         #
    #                       #
     #                     #
      #                   #
       #                 #
        #               #
         #             #
          #           #
           #         #
            #       #
             #     #
              #   #
               # #
                #