LeetCode 刷题之路07 HashMap

哈希表

哈希表可简单理解为，键值对的对应，Python中的应用如字典，counter对象等。首先熟练用字典记录数字重复次数，类似的哈希表的题也就能慢慢理解了。
刷的这些题的过程中，印象最深的要数最后一个题，只出现一次的数字！
PS：leetcode 四月份的刷题活动开始了，可以作为小练习参与

思路

解题的思路，总的来说是从题意中找出对应的数据关系，明确题目是要求出现次数，重复字母的个数，字符串的对应；大体来说是键值对的变形，最后加上题目要求的逻辑输出。

"""https://leetcode.com/tag/hash-table/"""
from collections import Counter
from typing import List


class Hash_solution:

    # 1365. How Many Numbers Are Smaller Than the Current Number
    def smallerNumbersThanCurrent(self, nums:List[int])->List[int]:
        # 排序，将第一次出现的数字下标放入字典中存储
        n = sorted(nums)
        dic, res = {}, []
        for index, value in enumerate(n):
            if value not in dic:
                dic[value] = index
        for num in nums:
            res.append(dic[num])
        return res

    # 771. Jewels and Stones
    def numJewelsInStones(self, J:str, S:str)->int:
        count = 0
        for ch in S:
            if ch in J:
                count += 1
        return count

    # 961. N-Repeated Element in Size 2N Array
    def repeatedNTimes(self, A:List[int]):
        if not A:   return None
        dic = {}
        for i in A:
            if i in dic:    dic[i] += 1
            else:           dic[i] = 1
        for key in dic:
            if dic[key] == len(A)/2:
                return key

    # 1207. Unique Number of Occurrences
    def uniqueOccurrences(self, arr:List[int]):
        # 字典储存数字和出现的次数，键集合长度等于出现次数长度，则是独立出现的次数
        dic = {}
        for i in arr:
            if i in dic:    dic[i] += 1
            else:   dic[i]=1
        key, values = set(dic.keys()), set(dic.values())
        if len(key) == len(values): return True
        else:   return False

    # 811, Subdomain Visit Count
    def subdomainVisit(self, cpdomains:List[str])->List[str]:
        dic = {}
        for domains in cpdomains:
            n, sd = domains.split()     # split 切割字符串，返回列表
            n = int(n)
            segment = sd.split(".")     # 切割 域名
            for i in range(len(segment)):
                subdomains = ".".join(segment[i:])  # 从i 开始往后连接
                # if subdomains in dic:
                #     dic[subdomains] += n
                # else:
                #     dic[subdomains] = n
                dic[subdomains] = dic[subdomains] + n  if subdomains in dic else n
        return [ str(dic[key])+" " + key  for key, value in dic.items()]
        # print(dic)
        # res = []
        # for key in dic.keys():
        #     s =str(dic[key])+ " " + key
        #     res.append(s)
        # return res

    # 1160  Find Words That Can Be Formed by Characters
    def counterCharacter(self, words:List[str], chars:str):
        count = 0
        for word in words:
            # The all() function returns True if all items in an iterable are true, otherwise it returns False. If the iterable object is empty, the all() function also returns True.
            if all(Counter(word)[ch] <= Counter(chars)[ch] for ch in word):
                count += len(word)
        return count

    def singleNumber(self, nums):
        """
        :type nums: List[int]
        :rtype: int
        """
        a = 0
        for i in nums:
            a ^= i  # A 异或 A = 0， 则全部异或最后剩下的就是唯一出现的
        return a


if __name__ == '__main__':
    hh = Hash_solution()
    # nums = [8,1,2,2,3]      # 1365  [8,1,2,2,3]  -> [4, 0, 1, 1, 3]
    # print(hh.smallerNumbersThanCurrent(nums))
    J = "aA"
    S = "aAAbbbb"       # 771
    n = [5,1,5,2,5,3,5,4]       # 961. Repeted times
    arr = [1, 2, 2, 1, 1, 3]    # 1207 True
    # print(hh.uniqueOccurrences(arr))
    sv =["900 google.mail.com", "50 yahoo.com", "1 intel.mail.com", "5 wiki.org"]    # 811 ["9001 discuss.leetcode.com"]
    words =  ["cat","bt","hat","tree"]  # 1160 ["hello", "world", "leetcode"]
    chars ="atach"      #  "welldonehoneyr"
    n = [4,1,2,1,2]
    print(hh.singleNumber(n))