超级会员免费看
这篇博客探讨了LeetCode上的62题和63题，即从网格左上角到右下角的唯一路径问题。在62题中，机器人只能向右或向下移动，而在63题中，某些位置不可通过。通过动态规划的方法，解释了解决这类问题的策略，并提供了示例和运行时间分析。
A robot is located at the top-left corner of a m x n grid (marked 'Start' in the diagram below).
The robot can only move either down or right at any point in time. The robot is trying to reach the bottom-right corner of the grid (marked 'Finish' in the diagram below).
How many possible unique paths are there?
Above is a 7 x 3 grid. How many possible unique paths are there?
Note: m and n will be at most 100.
Example 1:
Input: m = 3, n = 2
Output: 3
Explanation:
From the top-left corner, there a
订阅专栏 解锁全文
扫一扫
917
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
