| 일 | 월 | 화 | 수 | 목 | 금 | 토 |
|---|---|---|---|---|---|---|
| 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
- 파이썬
- 운영체제
- data science
- Convert Sorted List to Binary Search Tree
- attribute
- 컴퓨터의 구조
- Generator
- concurrency
- DWG
- 시바견
- Class
- iterator
- t1
- Python
- Regular Expression
- shiba
- kaggle
- 밴픽
- 109. Convert Sorted List to Binary Search Tree
- Protocol
- Python Implementation
- 프로그래머스
- 43. Multiply Strings
- 30. Substring with Concatenation of All Words
- Decorator
- Substring with Concatenation of All Words
- LeetCode
- Python Code
- 315. Count of Smaller Numbers After Self
- 715. Range Module
Archives
- Today
- Total
목록833. Find And Replace in String (1)
Scribbling
LeetCode: 833. Find And Replace in String
The very first thing to do is looking for matches. We don't need to use any fancy algorithms when looking for matches in this problem because it is guranteed that replacements will not overlap. Now we have matched list in the form of [index, source, target]. If you are planning to replace s directly, it will lead to bad time complexity as you will have to copy all the characters of s each time y..
Computer Science/Coding Test
2022. 3. 15. 09:48