LeetCode刷题（python3）|day06 第三章 哈希表part01

242.有效的字母异位词

class Solution:
    def isAnagram(self, s: str, t: str) -> bool:
        myHash = [0] * 26
        for i in range(len(s)):
            myHash[ord(s[i]) - ord('a')] += 1
        for i in range(len(t)):
            myHash[ord(t[i]) - ord('a')] -= 1
        for i in range(26):
            print(myHash[i])
            if myHash[i] != 0:
                return False
        return True

349. 两个数组的交集

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

202. 快乐数

class Solution:
    def isHappy(self, n: int) -> bool:
        myset = set()
        while n not in myset:
            myset.add(n)
            sum = 0
            temp = n
            while temp != 0:
                sum += (temp % 10)**2
                temp = temp // 10
            n = sum
            print(n)
            if sum == 1:
                return True
        return False
        

1. 两数之和

class Solution:
    def twoSum(self, nums: List[int], target: int) -> List[int]:
        mydict = dict()
        result = []
        for i in range(len(nums)):
            if (target - nums[i]) in mydict:
                result.extend([mydict[target - nums[i]], i])
                return result
            mydict[nums[i]] = i