| 일 | 월 | 화 | 수 | 목 | 금 | 토 |
|---|---|---|---|---|---|---|
| 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
- attribute
- 밴픽
- Decorator
- 프로그래머스
- concurrency
- Python Implementation
- Class
- 715. Range Module
- 30. Substring with Concatenation of All Words
- Generator
- 315. Count of Smaller Numbers After Self
- Substring with Concatenation of All Words
- Convert Sorted List to Binary Search Tree
- 운영체제
- Protocol
- iterator
- data science
- 컴퓨터의 구조
- 시바견
- Regular Expression
- 43. Multiply Strings
- 109. Convert Sorted List to Binary Search Tree
- Python Code
- DWG
- kaggle
- shiba
- Python
- t1
- LeetCode
- 파이썬
Archives
- Today
- Total
목록211. Design Add and Search Words Data Structure (1)
Scribbling
[Java 101] 211. Design Add and Search Words Data Structure - trie
class TrieNode { public boolean isWord = false; public TrieNode[] children = new TrieNode[26]; } class Trie { public TrieNode root; public Trie() { root = new TrieNode(); } public void insert(String word) { TrieNode cur = root; for (int i=0; i
Computer Science/Java
2023. 3. 11. 01:09