| 일 | 월 | 화 | 수 | 목 | 금 | 토 |
|---|---|---|---|---|---|---|
| 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
- Decorator
- 파이썬
- DWG
- Class
- data science
- t1
- LeetCode
- Regular Expression
- concurrency
- attribute
- 315. Count of Smaller Numbers After Self
- Python Implementation
- Generator
- 시바견
- 715. Range Module
- Python Code
- 운영체제
- 43. Multiply Strings
- shiba
- Protocol
- Substring with Concatenation of All Words
- Python
- 밴픽
- 컴퓨터의 구조
- 109. Convert Sorted List to Binary Search Tree
- 프로그래머스
- kaggle
- Convert Sorted List to Binary Search Tree
- 30. Substring with Concatenation of All Words
- iterator
Archives
- Today
- Total
목록The Number of Weak Characters in the Game (1)
Scribbling
LeetCode: 1996. The Number of Weak Characters in the Game
I found this problem is pretty similar to 'Russian Doll' prob (https://leetcode.com/problems/russian-doll-envelopes/). Thought process for this problem is: 0> Sort the properties. 1> Let's just assume that attack strictly increases (e.g. 3, 4, 5, ...): then what we should do is to count how many defense values have larger values on their right side. And that's exactly what monotonicly desc stack..
Computer Science/Algorithms & Data Structures
2022. 10. 21. 23:52