62 不同路径
dp数据含义:
dp[i][j] : 从0, 0到i, j有多少种不同路径
递推公式:
dp i j 由 dp i-1, j 和 dp i, j-1 推导出来
dp i, j = dp i - 1, j + dp i, j - 1
初始化:
for (int i = 0; i < n; i ++) dp[i][0] = 1
for (int j = 0; j < n; j ++) dp[0][j] = 1;
遍历顺序:
从左往右遍历(因为初始值在左面)
从上往下遍历(因为初始值在上面)
public static int uniquePaths(int m, int n) {
int[][] dp = new int[m][n];
//初始化
for (int i = 0; i < m; i++) {
dp[i][0] = 1;
}
for (int i = 0; i < n; i++) {
dp[0][i] = 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];
}
63 不同路径II
递推公式:
如果没有障碍,才进行推导
if (obs[i][j] == 0) …
初始化:
障碍的后面初始化为0,前面为1
障碍的下面初始化为0,前面为1
如果起始或终止位置为0,则return 0;
for (int i = 0; i < n && abs[i][0] == 0; i ++) dp[i][0] = 1;
for (int j = 0; j < n && abs[0][j] == 0; j ++) dp[0][j] = 1;
class Solution {
public int uniquePathsWithObstacles(int[][] obstacleGrid) {
int m = obstacleGrid.length;
int n = obstacleGrid[0].length;
int[][] dp = new int[m][n];
//如果在起点或终点出现了障碍,直接返回0
if (obstacleGrid[m - 1][n - 1] == 1 || obstacleGrid[0][0] == 1) {
return 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++) {
dp[i][j] = (obstacleGrid[i][j] == 0) ? dp[i - 1][j] + dp[i][j - 1] : 0;
}
}
return dp[m - 1][n - 1];
}
}