[LeetCode] Sparse Matrix Multiplication

  • 时间:
  • 浏览:0
  • 来源:万人红黑大战棋牌_万人红黑大战棋牌官网

You may assume that A's column number is equal to B's row number.

The solution is much more easier than we may have imagined. Take a look at this solution. But note that it is buggy as pointed out in the first comment (oh, how could the test cases be so weak)! I have rewritten it as follows.

Problem Description:


Given two sparse matrices A and B, return the result of AB.