方法:动态规划
①确定状态:dp[i][j] 为到达第 i +1 行 j+1 列网格的所有路径;
②转移方程:dp[i][j] = dp[i - 1][j] + dp[i][j - 1];
③初始条件和边界情况:obstacleGrid[i][j] == 0时,dp[i][j] = 1;
④计算顺序:因为 dp[i][j] 由 dp[i - 1][j] 和 dp[i][j - 1]推出,所以根据向下或向右按顺序遍历。
class Solution {
public int uniquePathsWithObstacles(int[][] obstacleGrid) {
if (obstacleGrid[0][0] == 1) return 0;
int m = obstacleGrid.length;
int n = obstacleGrid[0].length;
int[][] dp = new int[m][n];
//第一行
for (int i = 0; i < n; i++) {
if (obstacleGrid[0][i] == 1) break;
dp[0][i] = 1;
}
//第一列
for (int j = 0; j < m; j++) {
if (obstacleGrid[j][0] == 1) break;
dp[j][0] = 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];
}
}