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?
难度:Medium
解题思路: 我一开始想的是比如说从第i行第j个走下去,那么第i+1行就有n-j中走法,对于一个K行的地图,一共要选K-1个位置向下走。但是这样想了一想自己没有理顺,索性换一种思路:
在地图中的第(i,j)个位置,可以从(i-1,j)或者(i,j-1)这两个地方到达(i,j均从1开始),那么很容易就可以写出状态转移方程dp[i][j]=dp[i-1][j]+dp[i][j-1],接下来就可以从起点开始逐步扩展地图,直到求出dp[m-1][n-1],时间复杂度为O(m*n)
class Solution {
public:
int uniquePaths(int m, int n) {
int dp[m+1][n+1];
cout<<m<<" "<<n<<endl;
memset(&dp,0,sizeof(dp));
dp[0][0]=1;
for(int i = 0;i<max(m,n);i++)
{
if(i<n)
dp[0][i]=1;
if(i<m)
dp[i][0]=1;
}
for(int i = 1;i<m;i++)
{
for(int j = 1;j<n;j++)
{
dp[i][j]=dp[i][j-1]+dp[i-1][j];
}
}
return dp[m-1][n-1];
}
};