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.
分析:利用动态规划法,a[i+1][j+1] = a[i][j+1]+a[i+1][j]
class Solution {
public:
int uniquePaths(int m, int n) {
if((n == 0)&&(m == 0))return 0;
int a[101][101];
for(int i = 0; i < 101; i++)
{
a[0][i] = 1;
a[i][0] = 1;
}
for(int i = 0; i < n; i++)
for(int j = 0; j < m; j++)
{
a[i+1][j+1] = a[i][j+1]+a[i+1][j];
}
return a[n-1][m-1];
}
};