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
| // @Title: 不同路径 (Unique Paths)
// @Author: 15816537946@163.com
// @Date: 2020-12-09 08:39:17
// @Runtime: 0 ms
// @Memory: 2 MB
func uniquePaths(m int, n int) int {
if m == 1 || n == 1 {
return 1
}
dp := make([][]int, m)
for i := range dp {
dp[i] = make([]int, n)
dp[i][0] = 1
}
for i := range dp[0] {
dp[0][i] = 1
}
for i := 1; i < m; i++ {
for j := 1; j < n; j++ {
dp[i][j] = dp[i-1][j] + dp[i][j-1]
}
}
return dp[m-1][n-1]
}
|