229. Find mode II

• Question no ： Power button 229
• Knowledge point ： Count , Hash , Array
• Goal completion ：21/150
• summary
  stem ：
  

Ideas ：

• 1. Construct hash table through Dictionary ,cnt={key:value, ...} , Using the values in the array as the dictionary key, Take the number of occurrences of the value in the array as the number of occurrences of the dictionary value
• 2. Traversal array , Store the elements in the array and the number of occurrences of the elements in the dictionary cnt in
• 3. Find in dictionary value Greater than n//3 Of key

class Solution:
    def majorityElement(self, nums: List[int]) -> List[int]:
        cnt = {
    }
        ans = []
        for v in nums:
            if v in cnt:
                cnt[v] += 1
            else:
                cnt[v] = 1
        for key in cnt.keys():
            if cnt[key] > (len(nums) // 3):
                ans.append(key)
        return ans