public int[][] multiply(int[][] A, int[][] B) {
int m = A.length;
if (m == 0) return new int[0][];
int s1 = A[0].length;
int s2 = B.length;
if (s2 == 0) return new int[0][];
int n = B[0].length;
if (s1 != s2) return new int[0][];
int[][] res = new int[m][n];
for (int i = 0; i < m; i++) {
for (int j = 0; j < n; j++) {
int tmp = 0;
for (int k = 0; k < s1; k++) {
tmp += A[i][k] * B[k][j];
}
res[i][j] = tmp;
}
}
return res;
}
LeetCode 311 稀疏矩阵的乘法
最新推荐文章于 2022-09-23 23:32:11 发布