不同路径

Unique Paths

动态规划

2025/10/16

思路：二维动态规划

DP[i][j] = DP[i-1][j] + DP[i][j-1] DP[i][0] = 1 DP[0][j] = 1

评价：完全正确，秒了

Back to top