LeetCode – Sparse Matrix Multiplication (Java)

 

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.

1. Naive Method

public int[][] multiply(int[][] A, int[][] B) {
    //validity check
 
    int[][] C = new int[A.length][B[0].length];
    for(int i=0; i<C.length; i++){
        for(int j=0; j<C[0].length; j++){
            int sum=0;
            for(int k=0; k<A[0].length; k++){
                sum += A[i][k]*B[k][j];
            }
            C[i][j] = sum;
        }
    }
 
    return C;
}

2. Optimized Method

public int[][] multiply(int[][] A, int[][] B) {
    //validity check
 
    int[][] C = new int[A.length][B[0].length];
    for(int i=0; i<C.length; i++){
        for(int k=0; k<A[0].length; k++){
            if(A[i][k]!=0){
                for(int j=0; j<C[0].length; j++){
                    C[i][j] += A[i][k]*B[k][j];
                }
            }
        }
    }
 
    return C;
}

Related posts:

  1. LeetCode – Kth Smallest Element in a Sorted Matrix (Java)
  2. LeetCode – Longest Increasing Path in a Matrix (Java)
  3. LeetCode – Spiral Matrix II (Java)
  4. LeetCode – Spiral Matrix (Java)
Category >> Algorithms >> Interview  
If you want someone to read your code, please put the code inside <pre><code> and </code></pre> tags. For example: 
<pre><code> 
String foo = "bar";
</code></pre>

Leave a comment

CAPTCHA

*