62. Unique Paths
题目描述
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. 深度优先搜索,分两种情况,一种是不断开,一种是可断开时断开。
题解
使用动态规划自底向上解决,设状态f[i][j]为(1,1)到(i,j)的路线条数,仅能向右向下走,可得状态转移方程:
f[i][j] = f[i-1][j]+f[i][j-1]
Solution1:
class Solution {
public:
int uniquePaths(int m, int n) {
vector<int> f(n, 0);
f[0] = 1;
for (int i = 0; i < m; i++) {
for (int j = 0; j < n; j++) {
// f[i][j] = f[i-1][j]+f[i][j-1]
f[j] = f[j] + f[j-1];
}
}
return f[n-1];
}
};