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
解法一:
为了训练自己的递归,所以我第一个想到的方法就是写递归的方法。但是这种方法的复杂度是不能pass的,放出代码:
class Solution {
public int uniquePaths(int m, int n) {
return findPath(m,n,1,1);
}
public int findPath(int m,int n,int mCurr,int nCurr){
if(mCurr == m || nCurr == n){
return 1;
}else{
return findPath(m,n,mCurr+1,nCurr)+findPath(m,n,mCurr,nCurr+1);
}
}
}
解法二:
既然如此,那就只能是动态规划了。动态规划方程为: res[i][j] = res[i-1][j]+res[i][j-1]。
class Solution {
public int uniquePaths(int m, int n) {
int[][] res = new int[m][n];
for(int i=0;i<m;i++){
res[i][0] = 1;
}
for(int i=0;i<n;i++){
res[0][i] = 1;
}
for(int i=1;i<m;i++){
for(int j=1;j<n;j++){
res[i][j] = res[i-1][j]+res[i][j-1];
}
}
return res[m-1][n-1];
}
}
解法三:
实际上就是一个概率问题。本质上是从m+n-2个球里取出m-1个不同的情况,熟悉不?其实就是C(m-1)(m+n-2),直接套公式就好了,O(n)的复杂度搞定。不过要注意int阶乘后的越界问题。