mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-01-11 02:58:13 +08:00
54 lines
1.5 KiB
HTML
54 lines
1.5 KiB
HTML
|
<p>一个机器人位于一个 <code>m x n</code><em> </em>网格的左上角 （起始点在下图中标记为 “Start” ）。</p>
|
|||
|
|
|
|||
|
|
<p>机器人每次只能向下或者向右移动一步。机器人试图达到网格的右下角（在下图中标记为 “Finish” ）。</p>
|
|||
|
|
|
|||
|
|
<p>问总共有多少条不同的路径？</p>
|
|||
|
|
|
|||
|
|
<p> </p>
|
|||
|
|
|
|||
|
|
<p><strong>示例 1：</strong></p>
|
|||
|
|
|
|||
|
|
<p><img src="https://assets.leetcode.com/uploads/2018/10/22/robot_maze.png" /></p>
|
|||
|
|
|
|||
|
|
<pre>
|
|||
|
|
<strong>输入：</strong>m = 3, n = 7
|
|||
|
|
<strong>输出：</strong>28</pre>
|
|||
|
|
|
|||
|
|
<p><strong>示例 2：</strong></p>
|
|||
|
|
|
|||
|
|
<pre>
|
|||
|
|
<strong>输入：</strong>m = 3, n = 2
|
|||
|
|
<strong>输出：</strong>3
|
|||
|
|
<strong>解释：</strong>
|
|||
|
|
从左上角开始，总共有 3 条路径可以到达右下角。
|
|||
|
|
1. 向右 -> 向下 -> 向下
|
|||
|
|
2. 向下 -> 向下 -> 向右
|
|||
|
|
3. 向下 -> 向右 -> 向下
|
|||
|
|
</pre>
|
|||
|
|
|
|||
|
|
<p><strong>示例 3：</strong></p>
|
|||
|
|
|
|||
|
|
<pre>
|
|||
|
|
<strong>输入：</strong>m = 7, n = 3
|
|||
|
|
<strong>输出：</strong>28
|
|||
|
|
</pre>
|
|||
|
|
|
|||
|
|
<p><strong>示例 4：</strong></p>
|
|||
|
|
|
|||
|
|
<pre>
|
|||
|
|
<strong>输入：</strong>m = 3, n = 3
|
|||
|
|
<strong>输出：</strong>6</pre>
|
|||
|
|
|
|||
|
|
<p> </p>
|
|||
|
|
|
|||
|
|
<p><strong>提示：</strong></p>
|
|||
|
|
|
|||
|
|
<ul>
|
|||
|
|
<li><code>1 <= m, n <= 100</code></li>
|
|||
|
|
<li>题目数据保证答案小于等于 <code>2 * 10<sup>9</sup></code></li>
|
|||
|
|
</ul>
|
|||
|
|
|
|||
|
|
<p> </p>
|
|||
|
|
|
|||
|
|
<p><meta charset="UTF-8" />注意：本题与主站 62 题相同： <a href="https://leetcode-cn.com/problems/unique-paths/">https://leetcode-cn.com/problems/unique-paths/</a></p>
|