【问题描述】编写程序,输入一个3×4的矩阵A,输出矩阵的转置11.png以及二者的乘积22.png。输出矩阵的各列之间用Tab键对齐,输入输出格式如样例所示。
提示1:一个m行k列的矩阵A和k行n列的矩阵B的乘积C=AB是一个m行n列的矩阵,其第i行第j列的元素是由A的第i行的全部元素和B的第j列的全部元素对应相乘的和,即:33.png。
44.jpg
提示2:用三重循环解决,第一层用i遍历C的每一行,第二层用j遍历C的每一列,第三层用k遍历A的第i行每一列和B的第j列每一行求对应元素乘积并累加和作为C[i][j]。
【样例输入】
1 2 3 4
5 6 7 8
9 10 11 12
【样例输出】
55.png
package MatrixMultiply;
import java.util.Scanner;
public class MatrixMultiply {
public static void main(String[] args){
Scanner sc =new Scanner(System.in);
int hang = 3;
int lie = 4;
double a[][] = new double[hang][lie];
double b[][] = new double[lie][hang];
double c[][] = new double[hang][hang];
for (int i = 0; i < a.length; i++) {
for (int j = 0; j < a[i].length; j++) {
a[i][j] = sc.nextDouble();
}
}
for (int i = 0; i < a.length; i++) {
for (int j = 0; j < a[i].length; j++) {
b[j][i] = a[i][j];
}
}
for (int i = 0; i < a.length; i++) {
for (int j = 0; j < a.length; j++) {
b[j][i] = a[i][j];
double cij = 0;
for (int k = 0; k < lie; k++) {
cij += a[i][k] * b[k][j];
}
c[i][j] = cij;
}
}
System.out.println("Original matrix:");
for (int i = 0; i < a.length; i++) {
for (int j = 0; j < a[i].length; j++) {
System.out.printf("%.0f\t", a[i][j]);
}
System.out.println();
}
System.out.println("Transpose:");
for (int i = 0; i < b.length; i++) {
for (int j = 0; j < b[i].length; j++) {
System.out.printf("%.0f\t", b[i][j]);
}
System.out.println();
}
System.out.println("Matrix multiplication:");
for (int i = 0; i < c.length; i++) {
for (int j = 0; j < c[i].length; j++) {
System.out.printf("%.0f\t", c[i][j]);
}
System.out.println();
}
}
}