import java.util.Scanner; public class solution { public static void main(String[] args) { Scanner in = new Scanner(System.in); int num = in.nextInt(); for(int k = 0;k<num;k++) { int m = in.nextInt(); int n = in.nextInt(); int[][] a = new int[m][n];//把a看成一个引用 for (int i = 0; i < m; i++) { for (int j = 0; j < n; j++) { a[i][j] = in.nextInt(); } } int count = in.nextInt(); for (int i = 0; i < count; i++) { int op = in.nextInt(); switch (op) { case 1: m = a.length; n = a[0].length; int[][] b = new int[n][m]; b = change1(a); a = b;//其实a就是一个引用地址,可以改变 break; case 2: m = a.length; n = a[0].length; int[][] c = new int[n][m]; c = change2(a); a = c; break; case 3: change3(a); break; case 4: change4(a); break; case 5: int x0 = in.nextInt(); int y0 = in.nextInt(); int x1 = in.nextInt(); int y1 = in.nextInt(); int value = in.nextInt(); change5(a, x0, y0, x1, y1, value); break; } } m = a.length; n = a[0].length; for (int i = 0; i < m; i++) { for (int j = 0; j < n; j++) { System.out.print(a[i][j] + " "); } System.out.println(); } } } public static int[][] change1(int[][] a){ int m = a.length; int n = a[0].length; int[][] b = new int[n][m]; for(int i=0;i<n;i++){ for(int j=0;j<m;j++){ b[i][j] = a[m-1-j][i]; } } return b; } public static int[][] change2(int[][] a){ int m = a.length; int n = a[0].length; int[][] b = new int[n][m]; for(int i=0;i<n;i++){ for(int j=0;j<m;j++){ b[i][j] = a[j][n-1-i]; } } return b; } public static void change3(int[][] a){ int m = a.length; int n = a[0].length; int[][] b = new int[m][n]; for(int i=0;i<m;i++){ for(int j=0;j<n;j++){ b[i][j] = a[m-i-1][j]; } } for(int i=0;i<m;i++){ for(int j=0;j<n;j++){ a[i][j] = b[i][j]; } } } public static void change4(int[][] a){ int m = a.length; int n = a[0].length; int[][] b = new int[m][n]; for(int i=0;i<m;i++){ for(int j=0;j<n;j++){ b[i][j] = a[i][n-1-j]; } } for(int i=0;i<m;i++){ for(int j=0;j<n;j++){ a[i][j] = b[i][j]; } } } public static void change5(int[][] a,int x0,int y0,int x1,int y1,int value){ for(int i=x0;i<=x1;i++){ for(int j=y0;j<=y1;j++){ a[i][j] = a[i][j]+value; } } } }
一些思路
最新推荐文章于 2022-04-19 22:17:38 发布