java 实现回型矩阵

import java.util.Scanner;




public class Main {


private static int[][] data;
private static int i=0;
private static int j=0;
private static int mWidth;
private static int mHeight;
public static void main(String[] args) {
// while(true){
Scanner sc=new Scanner(System.in);
mWidth=sc.nextInt();
mHeight=sc.nextInt();
// System.out.println("mWidth:"+mWidth+",mHeight:"+mHeight);
data=new int[mHeight][mWidth];
Full(1,0,0,mWidth,mHeight);
for(int m=0;m<mHeight;m++){
for(int n=0;n<mWidth;n++){
if(n==mWidth-1){
System.out.println(data[m][n]);
}else{
System.out.print(data[m][n]+" ");
}
}
}
// }

}

public static void Full(int number,int beginWidth,int beginHeight,int width,int height){

i=beginWidth;
j=beginHeight;

if(width==0||height==0){
return;
}

if (width == 1 && height == 1) {
data[beginWidth][beginHeight] = number;
// System.out.println("width == 1 && height == 1"+i+","+j+","+number+","+data[i][j]);
return;
}

if (width == 1) {
if (i <= mHeight / 2) {
for (int k = 0; k < height; k++) {
data[i][j] = number;
// System.out.println("i<=mHeight/2"+i+","+j+","+number+","+data[i][j]);
i++;
number++;
}
return;
} else {
for (int k = 0; k < height ; k++) {
data[i][j] = number;
// System.out.println("else"+i+","+j+","+number+","+data[i][j]);
i--;
number++;
}
return;
}
}

if(height==1){
if(j<=mWidth/2){
for(int k=0;k<width;k++){
data[i][j]=number;
j++;
number++;
}
return;
}else{
for (int k = 0; k < width; k++) {
data[i][j] = number;
j--;
number++;
}
return;
}
}

for(int k=0;k<width-1;k++){
data[i][j]=number;
// System.out.println("i+j"+i+","+j+","+number+","+data[i][j]);
number++;
j++;
}
for(int k=0;k<height-1;k++){
data[i][j]=number;
// System.out.println("i+j"+i+","+j+","+number+","+data[i][j]);
number++;
i++;
}
for(int k=0;k<width-1;k++){
data[i][j]=number;
// System.out.println("i+j"+i+","+j+","+number+","+data[i][j]);
number++;
j--;
}
for(int k=0;k<height-1;k++){
data[i][j]=number;
// System.out.println("i+j"+i+","+j+","+number+","+data[i][j]);
number++;
i--;
}
Full(number,beginWidth+1,beginHeight+1,width-2,height-2);
}


}
  • 0
    点赞
  • 2
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值