Sparse Matrix Multiplication

这是回顾矩阵乘法怎么做，补课啊。

同时，因为是稀疏矩阵，有很多行或列是全0，于此，可以想到

if (A[i][k] == 0) {
                    continue;
                }

这个条件满足，即可跳过，因为这一行的结果计算定为0

public class Solution {
    public int[][] multiply(int[][] A, int[][] B) {
        int row = A.length, column = B[0].length;
        int[][] res = new int[row][column];
        for (int i = 0; i < row; i++) {
            for (int k = 0; k < A[0].length; k++) {
                if (A[i][k] == 0) {
                    continue;
                }
                for (int j = 0; j < B[0].length; j++) {
                    res[i][j] = res[i][j] + A[i][k] * B[k][j];
                }
            }
        }
        return res;
    }
}

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 |