Leetcode 311 Solution

This article provides solution to leetcode question 311 (sparse-matrix-multiplication)
Categories:
Tags:
Access this page by simply typing in "lcs 311" in your browser address bar if you have bunnylol configured.

https://leetcode.com/problems/sparse-matrix-multiplication

Solution

class Solution {
public:
    vector<vector<int>> multiply(vector<vector<int>>& A, vector<vector<int>>& B) {
        vector<vector<int>> res(A.size(), vector<int>(B[0].size()));



        for (int i = 0; i < A.size(); i++)
            for (int k = 0; k < A[0].size(); k++)
                if (A[i][k])
                    for (int j = 0; j < B[0].size(); j++)
                        res[i][j] += A[i][k] * B[k][j];



        return res;
    }
};