代码如下:
package qaq;
import java.util.Scanner;
public class qaq15 {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
System.out.print("输入矩阵的行:");
int m = sc.nextInt();
System.out.print("输入矩阵的列:");
int n = sc.nextInt();
int [][]a = new int[m][n];
for(int i=0;i<m;i++){
for(int j=0;j<n;j++){
a[i][j] = 20+(int)(Math.random()*10);
System.out.print(a[i][j]+" ");
}
System.out.println();
}
System.out.println("矩阵转置为:");
int [][]a1 = new int [n][m];
for(int i=0;i<n;i++){
for(int j=0;j<m;j++){
a1[i][j]=a[j][i];
System.out.print(a1[i][j]);
System.out.print(" ");
}
System.out.println(" ");
}
}
}
输出结果如下: