原创

JAVA回形数的实现

private static void backArray() {
Scanner scanner = new Scanner(System.in);
System.out.println("请输入回型数大小数值:");
int n = scanner.nextInt();
int[][] arr = new int[n][n];

int count = 0;//要显是的数量
int maxX = n - 1;//x轴的最大下标
int maxY = n - 1;//y轴的最大下标
int minX = 0;//x轴的最小下标
int minY = 0;//y轴的最小下表
while(minX <= maxX){
for(int x = minX; x <= maxX; x++){
arr[minY][x] = ++ count;
}
minY ++;
for(int y = minY; y <= maxY; y++){
arr[y][maxX] = ++ count;
}
maxX --;
for(int x = maxX; x >= minX; x--){
arr[maxY][x] = ++ count;
}
maxY --;
for(int y = maxY; y >= minY; y--){
arr[y][minX] = ++ count;
}
minX ++;
}
for (int i = 0; i < arr.length; i++) {
for (int j = 0; j < arr[i].length; j++) {
System.out.print(arr[i][j] + " ");
}
System.out.println();
}
}

JAVA回形数的实现

正文到此结束
本文目录