Question:
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 |
分析:
常规的矩阵乘法代码为(举例):
<span style="font-size:14px;">void arymul(int a[4][5], int b[5][3], int c[4][3])
{
int i, j, k;
int temp;
for(i = 0; i < 4; i++){
for(j = 0; j < 3; j++){
temp = 0;
for(k = 0; k < 5; k++){
temp += a[i][k] * b[k][j];
}
c[i][j] = temp;
}
}
}</span>
但是稀疏矩阵这样计算就会浪费时间,换一种计算方法,先不求结果的确定值,而是每次都只求部分值,依次累加即可。
代码如下:
<span style="font-size:14px;">class Solution {
public:
vector<vector<int>> multiply(vector<vector<int>>& A, vector<vector<int>>& B) {
int m = A.size(), n = B.size(), p = B[0].size();
vector<vector<int>> C(m, vector<int>(p, 0));
for (int i = 0; i < m; i++)//m是A的行数
for (int j = 0; j < n; j++)//n是A的列数和B的行数
if (A[i][j])
for (int k = 0; k < p; k++)//p是B的列数
C[i][k] += A[i][j] * B[j][k];
return C;
}
};</span>