hyunkookim 님의 블로그

217. Contains Duplicate class Solution: def containsDuplicate(self, nums: List[int]) -> bool: twice = {} for n in nums: if n not in twice: twice[n] = 0 else: twice[n] +=1 return True return False

146. LRU Cache https://youtu.be/7ABFKPK2hD4?si=R9ZwBAdBVxHzBRga # Node 추가 class Node: def __init__(self, key, val): self.key, self.val = key, val self.prev = self.next = Noneclass LRUCache: def __init__(self, capacity: int): self.capacity = capacity self.cache = {} # map key to node # left=LRU, right=most recent self.left, self.right = Node(0, 0), ..

1. Two Sum 최초 내 코드class Solution: def twoSum(self, nums: List[int], target: int) -> List[int]: l, r = 0, len(nums)-1 for l in range(len(nums)-1): for r in range(l+1, len(nums)): if nums[l]+nums[r] == target: return [l, r]  풀리긴 하지만, 아~ 주 비효율적임 https://youtu.be/KLlXCFG5TnA?si=hamrAV8oUfPTDA7b https://youtu.be/zH7F-qnTi74?si=lBLzCWaIWbKt..