Unique Paths
LeetCode 62 · View on LeetCode
Count the number of paths from top-left to bottom-right of an m x n grid, moving only right or down.
package main
import "fmt"
func uniquePaths(m, n int) int {
dp := make([]int, n)
for j := range dp {
dp[j] = 1
}
for i := 1; i < m; i++ {
for j := 1; j < n; j++ {
dp[j] += dp[j-1]
}
}
return dp[n-1]
}
func main() {
fmt.Println(uniquePaths(3, 7)) // 28
fmt.Println(uniquePaths(3, 2)) // 3
fmt.Println(uniquePaths(1, 1)) // 1
}