| 일 | 월 | 화 | 수 | 목 | 금 | 토 |
|---|---|---|---|---|---|---|
| 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
- Substring with Concatenation of All Words
- t1
- 컴퓨터의 구조
- 109. Convert Sorted List to Binary Search Tree
- 30. Substring with Concatenation of All Words
- Python Code
- Generator
- 715. Range Module
- concurrency
- DWG
- data science
- LeetCode
- 밴픽
- 프로그래머스
- shiba
- Class
- 43. Multiply Strings
- Convert Sorted List to Binary Search Tree
- 운영체제
- attribute
- Regular Expression
- 파이썬
- 시바견
- 315. Count of Smaller Numbers After Self
- Protocol
- iterator
- Python Implementation
- Decorator
- Python
- kaggle
Archives
- Today
- Total
목록monotonic stack (1)
Scribbling
Monotonic Stack
Monotonic stack or monotonicly increasing/decreasing stack is a stack which keeps its elements in increasing/decreasing order. Monotonic stacks are useful when, - Finding the very previous less element of each element in a vector in O(N) time complexity - Finding the very next less element of each element in a vector in O(N) time complexity (1) Code Example To get the very previous less (or equa..
Computer Science/Algorithms & Data Structures
2022. 8. 8. 01:47