| 일 | 월 | 화 | 수 | 목 | 금 | 토 |
|---|---|---|---|---|---|---|
| 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
- Protocol
- 시바견
- 밴픽
- DWG
- Python Implementation
- attribute
- t1
- Regular Expression
- Generator
- 43. Multiply Strings
- 30. Substring with Concatenation of All Words
- 컴퓨터의 구조
- Substring with Concatenation of All Words
- concurrency
- 파이썬
- Python Code
- 프로그래머스
- Convert Sorted List to Binary Search Tree
- 109. Convert Sorted List to Binary Search Tree
- Class
- 315. Count of Smaller Numbers After Self
- Python
- shiba
- 운영체제
- Decorator
- 715. Range Module
- iterator
- LeetCode
- data science
- kaggle
Archives
- Today
- Total
목록63. Unique Paths II (1)
Scribbling
LeetCode: 63. Unique Paths II
class Solution: def uniquePathsWithObstacles(self, obstacleGrid: List[List[int]]) -> int: n, m = len(obstacleGrid[0]), len(obstacleGrid) board = [[0] * n for _ in range(m)] board[0][0] = 1 obstacles = [] for i in range(m): for j in range(n): if obstacleGrid[i][j] == 1: board[i][j] = 0 obstacles.append((i, j)) for j in range(1, n): if (0, j) in obstacles: continue board[0][j] = board[0][j-1] for ..
Computer Science/Coding Test
2021. 9. 24. 17:55