63. Unique Paths II

Unique Paths II

There is one obstacle in the middle of a 3x3 grid as illustrated below.
[
[0,0,0],
[0,1,0],
[0,0,0]
]
The total number of unique paths is 2.
如果加了障碍会怎么样 其实也同样使用动态规划 多增加一步 在有障碍的一格为0 即如下：

代码

public class Solution {
    public int uniquePathsWithObstacles(int[][] obstacleGrid) {
        int m = obstacleGrid.length;
        int n = obstacleGrid[0].length;
        for(int i = 0; i < m; i++) {
        for(int j = 0; j < n; j++) {
            if(obstacleGrid[i][j] == 1) {
                obstacleGrid[i][j] = 0;  //障碍
            }
            else {
                if(i == 0 && j == 0) obstacleGrid[i][j] = 1;
                else if(i == 0 && j > 0) obstacleGrid[i][j] = obstacleGrid[i][j-1];
                else if(i > 0 && j == 0) obstacleGrid[i][j] = obstacleGrid[i-1][j];
                else obstacleGrid[i][j] = obstacleGrid[i-1][j] + obstacleGrid[i][j-1];
            }
        }
    }
    return obstacleGrid[m-1][n-1];
    }
}