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