LeetCode #311 - Sparse Matrix Multiplication

题目描述：

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:

Input:

A = [

  [ 1, 0, 0],

  [-1, 0, 3]

]

B = [

  [ 7, 0, 0 ],

  [ 0, 0, 0 ],

  [ 0, 0, 1 ]

]

Output:

          |  1 0 0 |    | 7 0 0 |    |  7 0 0 |

AB = | -1 0 3 | x | 0 0 0 | = | -7 0 3 |

                           | 0 0 1 |

稀疏矩阵乘法，A[i][k]等于0时，就不需要考虑B[k][j]。

class Solution {
public:
    vector<vector<int>> multiply(vector<vector<int>>& A, vector<vector<int>>& B) {
        int m=A.size();
        int n=B[0].size();
        vector<vector<int>> result(m,vector<int>(n,0));
        for(int i=0;i<m;i++)
        {
            for(int k=0;k<A[0].size();k++)
            {
                if(A[i][k]!=0)
                {
                    for(int j=0;j<n;j++)
                    {
                        if(B[k][j]!=0) result[i][j]+=A[i][k]*B[k][j];
                    }
                }
            }
        }
        return result;
    }
};