public class Solution {
public int[][] multiply(int[][] A, int[][] B) {
int row = A.length, column = B[0].length;
int[][] res = new int[row][column];
for (int i = 0; i < A.length; i++) {
for (int k = 0; k < A[0].length; k++) {
if (A[i][k] != 0) {
for (int j = 0; j < B[0].length; j++) {
res[i][j] = res[i][j] + A[i][k]*B[k][j];
}
}
}
}
return res;
}
}
Sparse Matrix Multiplication
最新推荐文章于 2022-09-02 20:32:04 发布