| 일 | 월 | 화 | 수 | 목 | 금 | 토 |
|---|---|---|---|---|---|---|
| 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
- Generator
- kaggle
- Decorator
- 30. Substring with Concatenation of All Words
- Python Code
- Python
- Python Implementation
- 715. Range Module
- 43. Multiply Strings
- 109. Convert Sorted List to Binary Search Tree
- Substring with Concatenation of All Words
- iterator
- 컴퓨터의 구조
- Protocol
- 운영체제
- Regular Expression
- attribute
- Class
- Convert Sorted List to Binary Search Tree
- data science
- concurrency
- 315. Count of Smaller Numbers After Self
- 시바견
- t1
- shiba
- 프로그래머스
- 밴픽
- 파이썬
- DWG
- LeetCode
Archives
- Today
- Total
목록465. Optimal Account Balancing (1)
Scribbling
LeetCode: 465. Optimal Account Balancing
First, we look through all the transactions and check how much money(or debt) each one has. Array self.money is storing that information, and we excluded the ones who don't have any money or debt. Next, let's define "helper(self, indexs)" as our goal function. It will return 'min # of transactions needed'. Here, we take indexes (tuple type) as the parameter of the function so that we can easily ..
Computer Science/Coding Test
2022. 2. 17. 20:19