62,614
社区成员
发帖
与我相关
我的任务
分享
int n=3;
for(int i=1;i<=(n-1)*2;i++){
for(int j=1;j<=(n-1)*2;j++){
double x= Math.abs(n-0.5-i);
double y= Math.abs(n-0.5-j);
if(x>=y){
System.out.print(n-((int)(x+0.5)));
}else{
System.out.print(n-((int)(y+0.5)));
}
}
System.out.println();
}
public class TestPrint2 {
public static void main(String[] args) {
int n=3;
for(int i=1;i<=n+1;i++){
for(int j=1;j<=n+1;j++){
int xx = Math.min(Math.min(i,j),Math.min(n+2-i, n+2-j));
System.out.print(xx);
}
System.out.println();
}
}
}
package interview;
public class TestPrint2 {
public static int getMinDistance(int n,int x,int y){
int west = x;
int east = n+2-x;
int north = y;
int south = n+2-y;
int xd = west<east?west:east;
int yd = north<south?north:south;
return xd<yd?xd:yd;
}
public static void main(String[] args) {
int n=3;
for(int i=1;i<=n+1;i++){
for(int j=1;j<=n+1;j++){
int xx = TestPrint2.getMinDistance(n, i, j);
System.out.print(xx);
}
System.out.println();
}
}
}
public static void printMap(int num){
for (int i = 0; i < num + 1; i++) {
for (int j = 0; j < num + 1; j++) {
System.out.print((int)Math.min(Math.min(i + 1, num - i + 1), Math.min(j + 1, num - j + 1)));
}
System.out.println();
}
}