일 | 월 | 화 | 수 | 목 | 금 | 토 |
---|---|---|---|---|---|---|
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 Implementation
- 시바견
- Substring with Concatenation of All Words
- iterator
- shiba
- data science
- Generator
- Convert Sorted List to Binary Search Tree
- 715. Range Module
- 파이썬
- 밴픽
- t1
- 프로그래머스
- Decorator
- DWG
- Regular Expression
- 운영체제
- 30. Substring with Concatenation of All Words
- Python Code
- 109. Convert Sorted List to Binary Search Tree
- 컴퓨터의 구조
- kaggle
- concurrency
- Class
- 315. Count of Smaller Numbers After Self
- Protocol
- 43. Multiply Strings
- attribute
- Python
- LeetCode
Archives
- Today
- Total
목록Unique Paths (1)
Scribbling
LeetCode: 62. Unique Paths
한국 고등학교 수학 공부했으면 다 푸는 문제 class Solution: def uniquePaths(self, m: int, n: int) -> int: board = [[1] * n for _ in range(m)] for i in range(1, m): for j in range(1, n): board[i][j] = board[i-1][j] + board[i][j-1] return board[m-1][n-1]
Computer Science/Coding Test
2021. 9. 24. 16:45