| 일 | 월 | 화 | 수 | 목 | 금 | 토 |
|---|---|---|---|---|---|---|
| 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
- Regular Expression
- data science
- 30. Substring with Concatenation of All Words
- 715. Range Module
- Class
- Python Code
- 315. Count of Smaller Numbers After Self
- 운영체제
- 프로그래머스
- Substring with Concatenation of All Words
- 파이썬
- t1
- kaggle
- Python
- LeetCode
- Generator
- 밴픽
- 43. Multiply Strings
- 시바견
- 109. Convert Sorted List to Binary Search Tree
- Protocol
- 컴퓨터의 구조
- Decorator
- Convert Sorted List to Binary Search Tree
- concurrency
- Python Implementation
- DWG
- attribute
- iterator
- shiba
Archives
- Today
- Total
목록329. Longest Increasing Path in a Matrix (1)
Scribbling
LeetCode: 329. Longest Increasing Path in a Matrix
Tip of the day: A problem starts with "Longest" usually has something to do with DP. Though the difficulty is hard, it's not a difficult one. Seeing the below code will be enough for sure, so I won't give any explanation about it. class Solution: def longestIncreasingPath(self, matrix: List[List[int]]) -> int: m, n = len(matrix), len(matrix[0]) self.matrix = matrix self.visited = [[False] * n fo..
Computer Science/Coding Test
2022. 1. 11. 17:26