本题要求你写个程序把给定的符号打印成沙漏的形状。例如给定17个“*”,要求按下列格式打印
*****
***
*
***
*****
所谓“沙漏形状”,是指每行输出奇数个符号;各行符号中心对齐;相邻两行符号数差2;符号数先从大到小顺序递减到1,再从小到大顺序递
增;首尾符号数相等。
给定任意N个符号,不一定能正好组成一个沙漏。要求打印出的沙漏能用掉尽可能多的符号。
输入在一行给出1个正整数N(<=1000)和一个符号,中间以空格分隔。
首先打印出由给定符号组成的最大的沙漏形状,最后在一行中输出剩下没用掉的符号数。
19 *
***** *** * *** *****
import java.util.Scanner; public class Main{ public static void main(String[] args) { Scanner in=new Scanner(System.in); int n=in.nextInt(); char p=in.next().charAt(0); int yu=0; int yibian=0; for(int i=0;i<Math.sqrt(n);i++) { if((2*i*i+4*i+1)<=n&&(2*(i+1)*(i+1)+4*i+5)>n) { yibian=i; yu=n-(2*i*i+4*i+1); break; } } for(int i=0;i<yibian;i++) { for(int j=0;j<i;j++) { System.out.print(" "); } for(int j=0;j<2*(yibian-i)+1;j++) { System.out.print(p); } System.out.println(); } for(int i=0;i<yibian;i++) { System.out.print(" "); } System.out.println(p); for(int i=yibian;i>0;i--) { for(int j=0;j<i-1;j++) { System.out.print(" "); } for(int j=0;j<2*(yibian-i+1)+1;j++) { System.out.print(p); } System.out.println(); } System.out.println(yu); } }
import java.io.BufferedReader; import java.io.IOException; import java.io.InputStreamReader; public class Main { public static void main(String[] args) throws IOException { BufferedReader bufferedReader = new BufferedReader(new InputStreamReader(System.in)); String[] parameters = bufferedReader.readLine().split(" "); int N = Integer.parseInt(parameters[0]); char symbol = parameters[1].charAt(0); int n = 0; while((2 * n * n - 1) <= N) { n++; } n--; int maxLineSymbolCount = 2 * n - 1; StringBuilder symbolString = new StringBuilder(maxLineSymbolCount); StringBuilder spaceString = new StringBuilder(maxLineSymbolCount / 2); for(int i = 0; i < maxLineSymbolCount; i++) { symbolString.append(symbol); } for(int i = 0; i < maxLineSymbolCount / 2; i++) { spaceString.append(' '); } for(int i = 1; i <= n; i++) { int symbolCount = (2 * (n - i + 1) - 1); int spaceCount = maxLineSymbolCount - symbolCount; System.out.println(spaceString.substring(0, spaceCount/2) + symbolString.substring(0, symbolCount)); } for(int i = 2; i <= n; i++) { int symbolCount = (2 * i - 1); int spaceCount = maxLineSymbolCount - symbolCount; System.out.println(spaceString.substring(0, spaceCount/2) + symbolString.substring(0, symbolCount)); } System.out.println(N - (2 * n * n - 1)); } }