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?
class Solution {
public:
int uniquePaths(int m, int n)
{
int dp[101][101];
for(int i=1; i<=m; i++)
dp[i][1] = 1;
for(int i=1; i<=n; i++)
dp[1][i] = 1;
for(int i=2; i<=m; i++)
for(int j=2; j<=n; j++)
dp[i][j] = dp[i][j-1] + dp[i-1][j];
return dp[m][n];
}
};