【卡雷尔杯】旋转

import java.util.Scanner;
//旋转–1
public class Test01 {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int m = sc.nextInt();//m表示二维数组的行数
System.out.println("–");
int n = sc.nextInt();//n表示二维数组的列数
System.out.println("-----------------");
int[][] arr = new int[m][n], spunArr = new int[n][m];//arr为旋转之前的数组，spunArr为旋转后的数组
//遍历数组为数组元素进行赋值
for (int i = 0; i < m; i++) {
for (int j = 0; j < n; j++) {
arr[i][j] = sc.nextInt();//为数组赋值
}
System.out.println("-----------------");
}
//旋转后得到的数组
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
//将arr数组旋转后的数据依次存入到新的数组spunArr中
spunArr[i][j] = arr[m - 1 - j][i];
}
}
//遍历数组spunArr，打印输出数据
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
System.out.print(spunArr[i][j] + " ");
}
System.out.println();
}
}
}