| 일 | 월 | 화 | 수 | 목 | 금 | 토 |
|---|---|---|---|---|---|---|
| 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
- 프로그래머스
- Python
- 컴퓨터의 구조
- 운영체제
- Decorator
- 315. Count of Smaller Numbers After Self
- 30. Substring with Concatenation of All Words
- Class
- Protocol
- data science
- kaggle
- Python Implementation
- shiba
- t1
- 파이썬
- 밴픽
- DWG
- LeetCode
- Convert Sorted List to Binary Search Tree
- Substring with Concatenation of All Words
- 43. Multiply Strings
- concurrency
- 시바견
- 109. Convert Sorted List to Binary Search Tree
- Python Code
- Regular Expression
- attribute
- 715. Range Module
- iterator
- Generator
Archives
- Today
- Total
목록1284. Minimum Number of Flips to Convert Binary Matrix to Zero Matrix (1)
Scribbling
LeetCode: 1284. Minimum Number of Flips to Convert Binary Matrix to Zero Matrix
Key observations needed to solve this prob are as below. 1) There is no need to push the same button twice, as it doesn't make any change. 2) Sequence of buttons doesn't matter. In the provided example, a possible solution was (1,0)->(0,1)->(1,1). However, any sequences of the three buttons produce the same result. Functions we need: 1) isComplete(): checks whether matrix only has zeros or not 2..
Computer Science/Coding Test
2022. 3. 4. 12:57