63. 不同路径 II
难度:中等 2020/7/6每日一题打卡
最近动态规划的题目好多啊
题目描述
解题思路
/*
* 63. 不同路径 II
* 2020/7/6 动态规划
*/
public int uniquePathsWithObstacles(int[][] obstacleGrid) {
int m = obstacleGrid.length;
int n = obstacleGrid[0].length;
int dp[][] = new int[m][n];
for (int i = 0; i < m; i++) {
if(obstacleGrid[i][0] == 1) { //1表示障碍物,不可达,那这个位置后面的都不可达
dp[i][0] = 0;
break;
}else {
dp[i][0] = 1;
}
}
for (int j = 0; j < n; j++) {
if(obstacleGrid[0][j] == 1) { //1表示障碍物,不可达,那这个位置后面的都不可达
dp[0][j] = 0;
break;
}else {
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];
}else {
dp[i][j] = 0;
}
}
}
return dp[m-1][n-1];
}