一、矩阵相乘
1 public int[][] matrixMulti(int[][] a, int[][]b){ 2 int[][] ans = new int[a.length][b[0].length]; 3 if (a[0].length != b.length) 4 { 5 System.out.println("矩阵无法相乘!"); 6 return ans; 7 } 8 9 //矩阵a是m*n,矩阵b是n*p的 10 for (int i=0;i<a.length ;i++ ) //i<m 11 { 12 for (int j=0;j<b[0].length ;j++ ) //j<p 13 { 14 15 for (int k=0;k<b.length ;k++ ) //k<n 16 { 17 ans[i][j] += a[i][k] * b[k][i]; 18 } 19 } 20 } 21 22 return ans; 23 }
时间: 2024-08-09 19:53:15