LeetCode - Dot Product of Two Sparse Vector

07.08.2021

小白一枚，文章仅当日记本记录学习进度 ;)

如被浏览，请多多指教，非常感谢大家纠错与建议！

（因留学顺便练习英语，所以部分用英文笔记，并无他意）

Approach 1 - Non-efficient Array Approach

在leetcode上看到这样一个评论：" I got this question at my FB onsite in August 2020. The interviewer did not accept my hashmap solution. He told me that hashing/lookups, while on surface look efficient, for large sparse vectors, hashing function takes up the bulk of the computation that we might be better off with the first method. While proposing hashmap/set solutions, take a minute to think about the complexity hashing function." 感觉说的在理，所以面试遇到最好两种方法最好都提及一下

* 自己犯的错误，vec.[i] is not subscriptable, vec作为input按照题目给的条件是SparseVector类的一个object，并不是list！所以要用vec.num[i]

class SparseVector:
    def __init__(self, nums: List[int]):
        self.nums = nums

    # Return