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问题。首先,让我们做一些观察。
由于机器人只能左右移动,当它到达某个点时,只有两种可能性:
它从上面到达那个点(向下移动到那个点);
它从左边到达那个点(向右移动到那个点)。
因此,我们有以下状态方程:假设到达一个点的路径数(i,j)被表示为p[ i ],很容易得出结论:P[i][j] = P[i - 1][j] + P[i][j - 1].。
上述方程的边界条件发生在最左边的列(P [i] [ j-1 ]不存在)和最上面的行(P [ i-1 ] [ J ]不存在)。这些条件可以通过初始化(预处理)来处理——对于所有有效的i,初始化P[0][j] = 1, P[i][0] = 1。注意,初始值是1而不是0!
现在我们可以写如下代码。
程序:
class Solution {
public:
int uniquePaths(int m, int n) {
vector<vector<int> > path(m, vector<int> (n, 1));
for (int i = 1; i < m; i++)
for (int j = 1; j < n; j++)
path[i][j] = path[i - 1][j] + path[i][j - 1];
return path[m - 1][n - 1];
}
};