2024每日刷题(一零四)
Leetcode—1570. 两个稀疏向量的点积
实现代码
class SparseVector {
public:SparseVector(vector<int> &nums) {for(int i = 0; i < nums.size(); i++) {if(nums[i]) {indexNum[i] = nums[i];}}}// Return the dotProduct of two sparse vectorsint dotProduct(SparseVector& vec) {if(indexNum.size() < vec.indexNum.size()) {return vec.dotProduct(*this);}int ans = 0;for(auto& [index, num]: vec.indexNum) {auto it = indexNum.find(index);if(it != indexNum.end()) {ans += it->second * num;}}return ans;}
private:unordered_map<int, int> indexNum;
};// Your SparseVector object will be instantiated and called as such:
// SparseVector v1(nums1);
// SparseVector v2(nums2);
// int ans = v1.dotProduct(v2);
运行结果
之后我会持续更新,如果喜欢我的文章,请记得一键三连哦,点赞关注收藏,你的每一个赞每一份关注每一次收藏都将是我前进路上的无限动力 !!!↖(▔▽▔)↗感谢支持!