第一题是不同路径https://leetcode.cn/problems/unique-paths/description/,按照动规五步曲,由于本题中涉及了两个维度m,n,故设定二维dp数组dp[i][j],表示到达i j位置时的不同路径数量。机器人只能向下或向右移动一步,因此dp[i][j]只与它的左一格和上一格有关,dp[i][j]= dp[i-1][j] +dp[i][j - 1]。初始化dp[0][j]与dp[i][0]为1,因为到达这两行中各点的路径数量只有1种。对二维dp数组采取从上到下,从左到右的遍历顺序。
class Solution {
public:
int uniquePaths(int m, int n) {
vector<vector<int>> dp(m, vector<int>(n,0));
for (int i = 0; i < m; i++){
dp[i][0] = 1;
}
for (int j = 0; j < n; j++){
dp[0][j] = 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];
}
};
第二题是不同路径IIhttps://leetcode.cn/problems/unique-paths-ii/,与上一题相似,区别在于dp数组的初始化,当在第一行或第一列中有障碍出现时,障碍之后的位置无法到达,无需初始化。秒了。
class Solution {
public:
int uniquePathsWithObstacles(vector<vector<int>>& obstacleGrid) {
int m = obstacleGrid.size();
int n = obstacleGrid[0].size();
if (obstacleGrid[0][0] == 1 || obstacleGrid[m - 1][n - 1] == 1)
return 0;
vector<vector<int>> dp(m, vector<int> (n, 0));
for (int i = 0; i < m && obstacleGrid[i][0] == 0; i++){
dp[i][0] = 1;
}
for (int j = 0; j < n && obstacleGrid[0][j] == 0; j++){
dp[0][j] = 1;
}
for(int i = 1; i < m; i++){
for(int j = 1; j < n; j++){
if (obstacleGrid[i][j] == 0)
dp[i][j] = dp[i - 1][j] + dp[i][j - 1];
}
}
return dp[m - 1][n - 1];
}
};