1570. Dot Product of Two Sparse Vectors
1570. Dot Product of Two Sparse Vectors
Description
Given two sparse vectors, compute their dot product.
Implement class SparseVector
:
SparseVector(nums)
Initializes the object with the vectornums
dotProduct(vec)
Compute the dot product between the instance of SparseVector andvec
A sparse vector is a vector that has mostly zero values, you should store the sparse vectorefficiently and compute the dot product between two SparseVector.
Follow up: What if only one of the vectors is sparse?
Example 1:
1 | Input: nums1 = [1,0,0,2,3], nums2 = [0,3,0,4,0] |
Example 2:
1 | Input: nums1 = [0,1,0,0,0], nums2 = [0,0,0,0,2] |
Example 3:
1 | Input: nums1 = [0,1,0,0,2,0,0], nums2 = [1,0,0,0,3,0,4] |
Constraints:
n == nums1.length == nums2.length
1 <= n <= 10^5
0 <= nums1[i], nums2[i]<= 100
Hints/Notes
- 2025/01/24
- pairs of index and value
- Leetcode solution(checked)
Solution
Language: C++
1 | class SparseVector { |