题目描述
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 3 x 7 grid. How many possible unique paths are there?
Note: m and n will be at most 100.
分析:只能向下或者向右走,可以想到用dp方法,用一个二维数组维护递推关系,直到右下角。时间复杂度为O(mn),空间复杂度为O(m+n)。
class Solution {
public:
int uniquePaths(int m, int n)
{
vector<vector<int>> dp(m,vector<int>(n,0));
for(int i=0;i<m;i++)
dp[i][0]=1;
for(int j=0;j<n;j++)
dp[0][j]=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];
}
};
当然,由于左上角到右下角,可以确定的是总共要走m+n-2步,其中向下走n-1步,向右走m-1步。问题就可以转换为在m+n-2中取n-1或者m-1个数的情况了。时间复杂度较小点。
链接:https://www.nowcoder.com/questionTerminal/166eaff8439d4cd898e3ba933fbc6358
来源:牛客网
int uniquePaths(int m, int n) {
long x = m+n-2; //不用long会溢出,阶乘求出来太大了
long y = min(m,n)-1;
long up = 1,down =1; //最后求组合数的分子/分母
if(m==1||n==1) return 1;
for(int i = 0;i<y ;i++){
up *= x--;
}
for(int i = y;i>0 ;i--){
down *= i;
}
return int(up/down);
}