2027秋招备战day7
- 不同路径
简单动态规划，转移方程：f[i][j] = f[i -1][j] + f[i][j - 1]，可以压为一维
func uniquePaths(m int, n int) int {f := make([]int, n + 1)for i := range f{f[i] = 1}for i := 2; i <= m; i ++{for j := 2; j <= n; j ++{f[j] += f[j - 1]}}return f[n]
}
func uniquePaths(m int, n int) int {f := make([]int, n + 1)for i := range f{f[i] = 1}for i := 2; i <= m; i ++{for j := 2; j <= n; j ++{f[j] += f[j - 1]}}return f[n]
}