题解 | #矩阵乘法#
矩阵乘法
https://www.nowcoder.com/practice/ebe941260f8c4210aa8c17e99cbc663b
import java.io.*; // 注意类名必须为 Main, 不要有任何 package xxx 信息 public class Main { public static void main(String[] args) { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); try { int x = Integer.valueOf(br.readLine()); int y = Integer.valueOf(br.readLine()); int z = Integer.valueOf(br.readLine()); int[][] m = new int[x][y]; int[][] n = new int[y][z]; for (int i = 0; i < x; i++) { String[] s = br.readLine().split(" "); for (int j = 0; j < y; j++) { m[i][j] = Integer.valueOf(s[j]); } } for (int i = 0; i < y; i++) { String[] s = br.readLine().split(" "); for (int j = 0; j < z; j++) { n[i][j] = Integer.valueOf(s[j]); } } int[][] ans = new int[x][z]; for (int i = 0; i < x; i++) { for (int j = 0; j < z; j++) { for (int k = 0; k < y; k++) { ans[i][j] += m[i][k] * n[k][j]; } } } for (int[] an : ans) { for (int i : an) { System.out.print(i + " "); } System.out.println(); } } catch (IOException e) { e.printStackTrace(); } } }