问题描述
小明为某机构设计了一个十字型的徽标(并非红十字会啊),如下所示:
..$$$$$$$$$$$$$..
..$...........$..
$$$.$$$$$$$$$.$$$
$...$.......$...$
$.$$$.$$$$$.$$$.$
$.$...$...$...$.$
$.$.$$$.$.$$$.$.$
$.$.$...$...$.$.$
$.$.$.$$$$$.$.$.$
$.$.$...$...$.$.$
$.$.$$$.$.$$$.$.$
$.$...$...$...$.$
$.$$$.$$$$$.$$$.$
$...$.......$...$
$$$.$$$$$$$$$.$$$
..$...........$..
..$$$$$$$$$$$$$..
..$...........$..
$$$.$$$$$$$$$.$$$
$...$.......$...$
$.$$$.$$$$$.$$$.$
$.$...$...$...$.$
$.$.$$$.$.$$$.$.$
$.$.$...$...$.$.$
$.$.$.$$$$$.$.$.$
$.$.$...$...$.$.$
$.$.$$$.$.$$$.$.$
$.$...$...$...$.$
$.$$$.$$$$$.$$$.$
$...$.......$...$
$$$.$$$$$$$$$.$$$
..$...........$..
..$$$$$$$$$$$$$..
对方同时也需要在电脑dos窗口中以字符的形式输出该标志,并能任意控制层数。
输入格式
一个正整数 n (n<30) 表示要求打印图形的层数。
输出格式
对应包围层数的该标志。
样例输入1
1
样例输出1
..$$$$$..
..$...$..
$$$.$.$$$
$...$...$
$.$$$$$.$
$...$...$
$$$.$.$$$
..$...$..
..$$$$$..
..$...$..
$$$.$.$$$
$...$...$
$.$$$$$.$
$...$...$
$$$.$.$$$
..$...$..
..$$$$$..
样例输入2
3
样例输出2
..$$$$$$$$$$$$$..
..$...........$..
$$$.$$$$$$$$$.$$$
$...$.......$...$
$.$$$.$$$$$.$$$.$
$.$...$...$...$.$
$.$.$$$.$.$$$.$.$
$.$.$...$...$.$.$
$.$.$.$$$$$.$.$.$
$.$.$...$...$.$.$
$.$.$$$.$.$$$.$.$
$.$...$...$...$.$
$.$$$.$$$$$.$$$.$
$...$.......$...$
$$$.$$$$$$$$$.$$$
..$...........$..
..$$$$$$$$$$$$$..
..$...........$..
$$$.$$$$$$$$$.$$$
$...$.......$...$
$.$$$.$$$$$.$$$.$
$.$...$...$...$.$
$.$.$$$.$.$$$.$.$
$.$.$...$...$.$.$
$.$.$.$$$$$.$.$.$
$.$.$...$...$.$.$
$.$.$$$.$.$$$.$.$
$.$...$...$...$.$
$.$$$.$$$$$.$$$.$
$...$.......$...$
$$$.$$$$$$$$$.$$$
..$...........$..
..$$$$$$$$$$$$$..
提示
请仔细观察样例,尤其要注意句点的数量和输出位置。
import java.util.Scanner;
public class Main{
public static void main(String[] args) {
Scanner sc=new Scanner(System.in);
int n=Integer.parseInt(sc.nextLine());
int x=5+4*n;
char[][] ch=new char[x][x];
int k=x/2;
ch[k][k]='$';
for (int i = k-2; i <=k+2; i++) {
for (int j = k-2; j <=k+2 ; j++) {
if(i==k || j==k) ch[i][j]='$';
else ch[i][j]='.';
}
}
for (int p = 1; p < n+1; p++) {
/**
* 4个拐角
*/
ch[k-2*p][k-2*p]='$';
ch[k-2*p][k+2*p]='$';
ch[k+2*p][k-2*p]='$';
ch[k+2*p][k+2*p]='$';
for (int i = k-2-2*p; i <=k+2+2*p; i++) {
for (int j =k-2-2*p; j <=k+2+2*p; j++) {
/**
* 求边角部分
*/
if((i<k-2*p||i>k+2*p)&&(j<k-2*p||j>k+2*p)){
ch[i][j]='.';
}
/**
* 求顶部和尾部(横排)
*/
if((i==k-2-2*p ||i== k+2+2*p) &&(j>=k-2*p && j<=k+2*p)){
ch[i][j]='$';
}
/**
* 求左部和右部(竖排)
*/
if((j==k-2-2*p ||j== k+2+2*p) &&(i>=k-2*p && i<=k+2*p)){
ch[i][j]='$';
}
/**
* 求顶部和尾部(横排)
*/
if((i==k-1-2*p ||i== k+1+2*p) &&(j>k-2*p && j<k+2*p)){
ch[i][j]='.';
}
/**
* 求左部和右部(竖排)
*/
if((j==k-1-2*p ||j== k+1+2*p) &&(i>k-2*p && i<k+2*p)) {
ch[i][j]='.';
}
if(ch[i][j]=='.' || ch[i][j]=='$'){
continue;
}else {
ch[i][j]='$';
}
}
}
}
for (int i = 0; i < ch.length; i++) {
for (int j = 0; j < ch[i].length; j++) {
System.out.print(ch[i][j]);
}
System.out.println();
}
}
}