Python C++ hashmap解Leetcode 3160 Find the Number of Distinct Colors Am...

Python C++  hashmap解Leetcode 3160  Find the Number of Distinct Colors Among the Balls

嘗試2個hashmap來解決。由於實際運行，可以說，Python dict 比 C++ unordered_map 快得多

[Py3 code請進]

----

Try 2 hash maps to solve. Due to real runs, It can be said, Python dict is much faster than C++ unordered_map

[codes on Leetcode]https://leetcode.com/problems/find-the-number-of-distinct-colors-among-the-balls/solutions/6387016/2-hash-maps-1-pass-c-95-82-python/

[leetcode Playlist]https://www.youtube.com/watch?v=NayZG_FnMzE&list=PLYRlUBnWnd5IdDHk2BjqXwesydU17z_xk

class Solution:
    def queryResults(self, limit: int, queries: List[List[int]]) -> List[int]:
        n=len(queries)
        ans=[0]*n
        mp={}
        color=defaultdict(int)
        i=0
        for x, c in queries:
            if x in mp:
                c0=mp[x]
                color[c0]-=1
                if color[c0]==0:
                    color.pop(c0)
            mp[x]=c
            color[c]+=1
            ans[i]=len(color)
            i+=1
        return ans