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问题。
由于机器人只能向右下移动,当它到达某一点时,只有两种可能性:
1.从上方到达这一点。
2.从左方到达这一点。
因此,有如下状态方程:假设到达点的路径数量(i, j)表示为grids[i][j],很容易得出结论grids[i][j] = grids[i - 1][j] + grids[i][j - 1]。
上面的边界条件出现在最左边的列(P[i][j - 1]不存在)和最上面的行(P[i - 1][j]不存在)。这些条件可以通过初始化(预处理)进行处理---初始化P[0][j] = 1, P[i][0] = 1
AC代码:时间O(n*m) 空间O(n*m)
class Solution {
public:
int uniquePaths(int m, int n) {
int grids[101][101];
for(int i=0;i<m;i++){
for(int j=0;j<n;j++){
if(i==0||j==0)
grids[i][j] = 1;
else
grids[i][j] = grids[i-1][j]+grids[i][j-1];
}
}
return grids[m-1][n-1];
}
};