Leetcode 62. Unique Paths
Posted pegasus923
tags:
篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了Leetcode 62. Unique Paths相关的知识,希望对你有一定的参考价值。
https://leetcode.com/problems/unique-paths/
Medium
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 are a total of 3 ways to reach the bottom-right corner: 1. Right -> Right -> Down 2. Right -> Down -> Right 3. Down -> Right -> Right
Example 2:
Input: m = 7, n = 3 Output: 28
- 动归。
以上是关于Leetcode 62. Unique Paths的主要内容,如果未能解决你的问题,请参考以下文章