일 | 월 | 화 | 수 | 목 | 금 | 토 |
---|---|---|---|---|---|---|
1 | 2 | 3 | 4 | 5 | 6 | |
7 | 8 | 9 | 10 | 11 | 12 | 13 |
14 | 15 | 16 | 17 | 18 | 19 | 20 |
21 | 22 | 23 | 24 | 25 | 26 | 27 |
28 | 29 | 30 | 31 |
Tags
- 715. Range Module
- 밴픽
- Substring with Concatenation of All Words
- 컴퓨터의 구조
- 315. Count of Smaller Numbers After Self
- Regular Expression
- Convert Sorted List to Binary Search Tree
- 43. Multiply Strings
- iterator
- DWG
- Class
- 프로그래머스
- 운영체제
- kaggle
- Python
- shiba
- Protocol
- LeetCode
- Generator
- 109. Convert Sorted List to Binary Search Tree
- t1
- data science
- 30. Substring with Concatenation of All Words
- 시바견
- Python Code
- Decorator
- concurrency
- 파이썬
- Python Implementation
- attribute
Archives
- Today
- Total
목록HashMap (1)
Scribbling
Design HashMap -- Python Implementation
To design a hashmap, we need 1) hashing function -- will use hash() method 2) an array for the hash table 3) Linkedlist for hash collision class Node: def __init__(self, key, val, nxt=None): self.key = key self.val = val self.nxt = nxt class LinkedList: def __init__(self): self.head = Node(0, 0) def append(self, key, val) -> None: prv, cur = self.head, self.head.nxt while cur is not None: if cur..
Computer Science/Algorithms & Data Structures
2023. 10. 5. 00:48