| 일 | 월 | 화 | 수 | 목 | 금 | 토 |
|---|---|---|---|---|---|---|
| 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 |
Tags
- Generator
- attribute
- 컴퓨터의 구조
- Python Code
- Regular Expression
- iterator
- Decorator
- 운영체제
- Python
- Python Implementation
- 파이썬
- concurrency
- DWG
- kaggle
- LeetCode
- 시바견
- Protocol
- Class
- 프로그래머스
- 43. Multiply Strings
- Convert Sorted List to Binary Search Tree
- Substring with Concatenation of All Words
- t1
- data science
- 밴픽
- 315. Count of Smaller Numbers After Self
- 715. Range Module
- shiba
- 109. Convert Sorted List to Binary Search Tree
- 30. Substring with Concatenation of All Words
Archives
- Today
- Total
목록code (1)
Scribbling
Fenwick Tree (or Binary Indexed Tree) Python Implementation, 308. Range Sum Query 2D - Mutable
Fenwick Tree (or Binary Indexed Tree) is very efficient in dealing with range queries, especially when elements get updated occasionally. For how it works, refer to the below video. He elaborates on the principle of the tree in a very clean way. https://www.youtube.com/watch?v=CWDQJGaN1gY&t=160s&ab_channel=TusharRoy-CodingMadeSimple Below is the python implementation of it. class Fenwick: """ Py..
Computer Science/Algorithms & Data Structures
2023. 3. 2. 00:16