题目:
思路:
动态规划,比较容易。m[i][j] = m[i-1][j] + m[i][j-1](如下图所示)。
代码实现:
class Solution {
public:
int uniquePaths(int m, int n) {
int dp[101][101];
if (m <= 1 || n <= 1){
return 1;
}
for (int i = 1; i <= m; ++i){
for (int j = 1; j <= n; ++j){
dp[i][j] = 0;
}
}
// 初始化第一行与第一列
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-1][j] + dp[i][j-1];
}
}
return dp[m][n];
}
};
可优化之处:
实际上,dp数组只需要一行的空间就够了。
discuss:
class Solution {
public:
int uniquePaths(int m, int n) {
vector<vector<int>> dp (m, vector<int>(n, 1)); // 第一行和第一列一定是1
for (int i = 1; i < m; ++i){
for (int j = 1; j < n; ++j){
dp[i][j] = dp[i-1][j] + dp[i][j-1];
}
}
return dp[m-1][n-1];
}
};