| 일 | 월 | 화 | 수 | 목 | 금 | 토 |
|---|---|---|---|---|---|---|
| 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
- 파이썬
- 컴퓨터의 구조
- 109. Convert Sorted List to Binary Search Tree
- Decorator
- iterator
- attribute
- Protocol
- Regular Expression
- Python Code
- Python Implementation
- concurrency
- t1
- Python
- kaggle
- 시바견
- Substring with Concatenation of All Words
- 프로그래머스
- LeetCode
- Convert Sorted List to Binary Search Tree
- Class
- 315. Count of Smaller Numbers After Self
- 밴픽
- shiba
- data science
- DWG
- 운영체제
- 715. Range Module
- Generator
- 43. Multiply Strings
- 30. Substring with Concatenation of All Words
Archives
- Today
- Total
목록839 (1)
Scribbling
LeetCode: 839. Similar String Groups
크게 두 단계로 풀 수 있다. 1) 알파벳 조합이 동일한 집합끼리 나눈다. 2) 각 집합 내에서 단어를 연결하고, 소 집합의 갯수를 구한다. This prob can be solved within two steps. 1) Group words by alphabet combinations 2) Connect words in each group and then get the number of small groups Code is quite straightforward, so I guess there's no need to explain more. Time complexity would be (O(N**2*k)), where N is the number of words and k is length of a w..
Computer Science/Algorithms & Data Structures
2022. 5. 25. 10:46