【刷题日记】

Handwritten Note

Code

Valid Anagram

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

Intersection of Two Arrays

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

Intersection of Two Linked Lists

class Solution:
    def getIntersectionNode(self, headA: ListNode, headB: ListNode) -> ListNode:
        a,b = headA, headB
        while a!=b:
            a = a.next if a else headB
            b = b.next if b else headA
        return b

Happy Number

class Solution:
    def isHappy(self, n: int) -> bool:
        def calculate(number):
            summation = 0
            while number:
                summation += (number % 10) **2
                number = number // 10
            return summation

        record = set()

        while True:
            n = calculate(n)
            if n == 1:
                return True
            if n in record:
                return False
            else:
                record.add(n)

Two Sum

class Solution:
    def twoSum(self, nums: List[int], target: int) -> List[int]:
        hash_table = dict()

        for i, v in enumerate(nums):
            if (target - v) in hash_table:
                return [hash_table[target - v], i]
            else:
                hash_table[v] = i
        return []