mirror of
https://github.com/halfrost/LeetCode-Go.git
synced 2025-07-04 16:12:47 +08:00
19 lines
314 B
Go
19 lines
314 B
Go
package leetcode
|
|
|
|
func uniquePaths(m int, n int) int {
|
|
dp := make([][]int, n)
|
|
for i := 0; i < n; i++ {
|
|
dp[i] = make([]int, m)
|
|
}
|
|
for i := 0; i < n; i++ {
|
|
for j := 0; j < m; j++ {
|
|
if i == 0 || j == 0 {
|
|
dp[i][j] = 1
|
|
continue
|
|
}
|
|
dp[i][j] = dp[i-1][j] + dp[i][j-1]
|
|
}
|
|
}
|
|
return dp[n-1][m-1]
|
|
}
|