做這道題的過程中,了解到java的二維數組實際上就是多個一維數組的數組,所以類似下面這樣的賦值是可以實現的.
~~~
public static void upturn(int d[][],int a,int b) {
int[] e = new int[b];
for (int i = 0; i < a/2; i++) {
e = d[i];
d[i] = d[a-i-1];
d[a-i-1] = e;
}
}
~~~
有了這個特性,那么矩陣翻轉就變得很方便了,不過左右翻轉,這個倒是沒法實現
完整代碼如下:
~~~
import java.util.Scanner;
public class Main{
public static void main(String[] args){
Scanner input = new Scanner(System.in);
int a,b,c;
a = input.nextInt();
b = input.nextInt();
c = input.nextInt();
int[][] d = new int[a][b];
for (int i = 0; i < a; i++) {
for (int j = 0; j < b; j++) {
d[i][j] = input.nextInt();
}
}
if(c == 1){
upturn(d, a, b);
}else {
leftturn(d, a, b);
}
for (int[] is : d) {
for (int i : is) {
System.out.print(i+" ");
}
System.out.println();
}
}
public static void upturn(int d[][],int a,int b) {
int[] e = new int[b];
for (int i = 0; i < a/2; i++) {
e = d[i];
d[i] = d[a-i-1];
d[a-i-1] = e;
}
}
public static void leftturn(int d[][],int a,int b) {
int temp;
for (int i = 0; i < b/2; i++) {
for (int j =0 ; j < a; j++) {
temp = d[j][i];
d[j][i] = d[j][b-i-1];
d[j][b-i-1] = temp;
}
}
}
}
~~~
