| 일 | 월 | 화 | 수 | 목 | 금 | 토 |
|---|---|---|---|---|---|---|
| 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
- Convert Sorted List to Binary Search Tree
- LeetCode
- 43. Multiply Strings
- 컴퓨터의 구조
- attribute
- t1
- 30. Substring with Concatenation of All Words
- iterator
- 109. Convert Sorted List to Binary Search Tree
- kaggle
- Decorator
- Python
- 시바견
- 715. Range Module
- Protocol
- 프로그래머스
- 315. Count of Smaller Numbers After Self
- DWG
- Class
- concurrency
- 운영체제
- Python Code
- Regular Expression
- shiba
- data science
- Substring with Concatenation of All Words
- Generator
- 파이썬
- 밴픽
- Python Implementation
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