add 1570

fishercoder1534 · fishercoder1534 · commit d1a1547e7911 · 2020-11-17T07:28:57.000-08:00
diff --git a/README.md b/README.md
@@ -36,6 +36,7 @@ _If you like this project, please leave me a star._ &#9733;
 |1576|[Replace All ?'s to Avoid Consecutive Repeating Characters](https://leetcode.com/problems/replace-all-s-to-avoid-consecutive-repeating-characters/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1576.java) |[:tv:](https://youtu.be/SJBDLYqrIsM)|Easy|String|
 |1574|[Shortest Subarray to be Removed to Make Array Sorted](https://leetcode.com/problems/shortest-subarray-to-be-removed-to-make-array-sorted/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1574.java) ||Medium|Array, Binary Search|
 |1572|[Matrix Diagonal Sum](https://leetcode.com/problems/matrix-diagonal-sum/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1572.java) ||Easy|Array|
+|1570|[Dot Product of Two Sparse Vectors](https://leetcode.com/problems/dot-product-of-two-sparse-vectors/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1570.java) ||Easy|Array, HashTable, Two Pointers|
 |1567|[Maximum Length of Subarray With Positive Product](https://leetcode.com/problems/maximum-length-of-subarray-with-positive-product/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1567.java) |[:tv:](https://youtu.be/bFer5PdsgpY)|Medium|Greedy|
 |1566|[Detect Pattern of Length M Repeated K or More Times](https://leetcode.com/problems/detect-pattern-of-length-m-repeated-k-or-more-times/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1566.java) |[:tv:](https://youtu.be/aJAV_VgmjdE)|Easy|Array|
 |1561|[Maximum Number of Coins You Can Get](https://leetcode.com/problems/maximum-number-of-coins-you-can-get/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1561.java) |[:tv:](https://youtu.be/hPe9Z3TiUrA)|Medium|Sort|
diff --git a/src/main/java/com/fishercoder/solutions/_1570.java b/src/main/java/com/fishercoder/solutions/_1570.java
@@ -0,0 +1,23 @@
+package com.fishercoder.solutions;
+
+public class _1570 {
+    public static class Solution1 {
+        class SparseVector {
+            int[] vector;
+
+            SparseVector(int[] nums) {
+                this.vector = nums;
+            }
+
+            // Return the dotProduct of two sparse vectors
+            public int dotProduct(SparseVector vec) {
+                int[] incoming = vec.vector;
+                int dotProduct = 0;
+                for (int i = 0; i < vector.length; i++) {
+                    dotProduct += incoming[i] * this.vector[i];
+                }
+                return dotProduct;
+            }
+        }
+    }
+}
