class Solution {
public int uniquePathsWithObstacles(int[][] obstacleGrid) {
int m = obstacleGrid.length;
int n = obstacleGrid[0].length;
// 1.确定dp数组
int[][] dp = new int[m][n];
// 2.确定递推关系
/**
if(obstacleGrid[i][j] == 0){
dp[i][j] = dp[i-1][j] + dp[i][j-1];
}
*/
// 3.初始化
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;
}
// 4.遍历顺序 从上到下,从左到右
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];
}
}
运行结果: