refactor 311

fishercoder1534 · fishercoder1534 · commit 98c5d76aa38e · 2020-06-02T08:30:15.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_311.java b/src/main/java/com/fishercoder/solutions/_311.java
@@ -1,30 +1,5 @@
 package com.fishercoder.solutions;
 
-/**
- * 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:
-
- 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 |
-
- */
 public class _311 {
 
     public static class Solution1 {
