Given two sparse matrices A and B, return the result of AB.
You may assume that A's column number is equal to B's row number.
Example:
A = [
[ 1, 0, 0],
[-1, 0, 3]
]
B = [
[ 7, 0, 0 ],
[ 0, 0, 0 ],
[ 0, 0, 1 ]
]
| 1 0 0 | | 7 0 0 | | 7 0 0 |
AB = | -1 0 3 | x | 0 0 0 | = | -7 0 3 |
| 0 0 1 |
public class Solution {
public int[][] multiply(int[][] A, int[][] B) {
if(A == null || B == null){
return null;
}
//矩阵相乘,结果为A的长度和B的宽度
int[][] res = new int[A.length][B[0].length];
for(int i=0; i<A.length; i++){ //A的长度
for(int j=0; j<A[0].length; j++){ //A的宽度, B的长度
if(A[i][j] != 0){
for(int k=0; k<B[0].length; k++){ //B的宽度
if(B[j][k] != 0){
res[i][k] += A[i][j] * B[j][k];
}
}
}
}
}
return res;
}
}