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?
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
Constraints:
1 <= m, n <= 100
- It's guaranteed that the answer will be less than or equal to
2 * 10 ^ 9
.
方法一:DFS回溯法,数据量较大时(TLE)
class Solution {
public:
int cnt = 0;
void backtracePath(int x,int y,int m, int n)
{
if(x >m || y > n){
return;
}
if( x == m && y == n)
{
cnt++;
return;
}
backtracePath(x + 1,y,m,n);
backtracePath(x, y + 1,m,n);
}
int uniquePaths(int m, int n) {
if(m == 0 || n == 0)
return 0;
cnt = 0;
backtracePath(0,0,m-1,n-1);
return cnt;
}
};
方法二:动态规划
递推公式:dp[i][j] = dp[i-1][j] + dp[i][j-1]
代码如下:
class Solution {
public:
int uniquePaths(int m, int n) {
vector<vector<int> > dp(m,vector<int>(n,0));
for(int i = 0; i < n; i++)
{
dp[0][i] = 1;
}
for(int i = 0; i < m; i++)
{
dp[i][0] = 1;
}
for(int i = 1; i < m; i++)
{
for(int j = 1; j < n; j++)
{
dp[i][j] = dp[i - 1][j] + dp[i][j - 1];
}
}
return dp[m-1][n-1];
}
};