python 哈希表总结

---

哈希表介绍

• 哈希表一般用来快速判断一个元素是否出现在集合里
• 哈希碰撞解决方法：拉链法，线性探测法

有效字母异位

1. 定义一个数组，因为都是小写字符串，所以长度为26
2. s中的字符遇到一个对应的index+1
3. t中的字符遇到一个对应的index－1

class Solution:
    def isAnagram(self, s: str, t: str) -> bool:
        record = [0 for _ in range(26)]
        for val in s:
            record[ord(val) - ord('a')] += 1
        for val in t:
            record[ord(val) - ord('a')] -= 1
        print(record)
        if all(_ == 0 for _ in record):
            return True
        else:
            return False

两个数组的交集

class Solution:
    def intersection(self, nums1: List[int], nums2: List[int]) -> List[int]:
        return list(set(nums1) & set(nums2))

快乐数

class Solution:
    def isHappy(self, n: int) -> bool:
        def caculate_happy(num):
            _sum = 0
            while num:
                n = (num % 10) ** 2
                _sum += n
                num = num // 10
            return _sum
        record = set()
        while True:
            n = caculate_happy(n)
            if n == 1:
                return True
            elif n in record:
                return False
            record.add(n)

两数之和

class Solution:
    def twoSum(self, nums: List[int], target: int) -> List[int]:
        records = dict()
        for idx, val in enumerate(nums):
            if target - val not in records:
                records[val] = idx
            else:
                return [records[target - val], idx]

四数相加

• 首先建一个字典record保存所有num1和num2之后，并记录他们的个数
• 设count为0
• 在num3和num4中寻找负值和前面你的和相同的数，寻找到就加上count中的该和的数量

class Solution:
    def fourSumCount(self, nums1: List[int], nums2: List[int], nums3: List[int], nums4: List[int]) -> int:
        record = dict()
        for i in nums1:
            for j in nums2:
                if i + j in record:
                    record[i + j] += 1
                else:
                    record[i + j] = 1
        count = 0
        for i in nums3:
            for j in nums4:
                n = - i - j
                if n in record:
                    count += record[-i-j]
        return count

赎金信

class Solution:
    def canConstruct(self, ransomNote: str, magazine: str) -> bool:
        record = [0 for _ in range(26)]
        for val in magazine:
            record[ord(val) - ord('a')] += 1
        for val in ransomNote:
            record[ord(val) - ord('a')] -= 1
        if all(_ >=0 for _ in record):
            return True
        else:
            return False

三数之和

用双指针

class Solution:
    def threeSum(self, nums: List[int]) -> List[List[int]]:
        n = len(nums)
        record = []
        nums.sort()
        for i in range(n):
            left = i + 1
            right = n-1
            if nums[i] > 0:
                break
            if i >= 1 and nums[i] == nums[i-1]:
                continue
            while left < right:
                target = nums[i] + nums[left] + nums[right]
                if target > 0:
                    right -= 1
                elif target < 0:
                    left += 1
                else:
                    record.append([nums[i], nums[left], nums[right]])
                    while left != right and nums[right] == nums[right - 1]: right -= 1
                    while left != right and nums[left] == nums[left + 1]: left += 1
                    right -= 1
                    left += 1
        return record

四数之和

class Solution:
    def fourSum(self, nums: List[int], target: int) -> List[List[int]]:
        nums.sort()
        n = len(nums)
        record = []
        for i in range(n):
            if i > 0 and nums[i] == nums[i - 1]:
                continue
            for k in range(i+1, n):
                if k > i + 1 and nums[k] == nums[k - 1]:
                    continue
                left = k + 1
                right = n - 1
                while left < right:
                    total = nums[i] + nums[k] + nums[left] + nums[right]
                    if total > target: right -= 1
                    elif total < target: left += 1
                    else:
                        record.append([nums[i], nums[k], nums[left], nums[right]])
                        while left != right and nums[left] == nums[left + 1]: left += 1
                        while left != right and nums[right] == nums[right - 1]: right -= 1
                        left += 1
                        right -= 1
        return record

感谢阅读