Leetcode -- UniquePath II

https://oj.leetcode.com/problems/unique-paths-ii/

Follow up for "Unique Paths":

Now consider if some obstacles are added to the grids. How many unique paths would there be?

An obstacle and empty space is marked as 1 and 0 respectively in the grid.

For example,
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.

Note: m and n will be at most 100.

public int uniquePathsWithObstacles(int[][] obstacleGrid)

这题和之前那题UniquePath其实没有两样，只是遇到Obstacle的时候就在当前位置不计算直接归0就可以了。具体算法就不再介绍了。

    public int uniquePathsWithObstacles(int[][] obstacleGrid) {
        if(obstacleGrid.length == 0 || obstacleGrid[0].length == 0)
            return 0;
        int[] dp = new int[obstacleGrid[0].length];
        for(int i = 0; i < obstacleGrid[0].length; i++){
            if(obstacleGrid[0][i] == 0)
                dp[i] = 1;
            else
                break;
        }
        for(int i = 1; i < obstacleGrid.length; i++){
            for(int j = 0; j < obstacleGrid[0].length; j++){
                if(j == 0){
                    dp[j] = obstacleGrid[i][j] == 0 ? dp[j] : 0;
                }else{
                    dp[j] = obstacleGrid[i][j] == 0 ? dp[j] + dp[j - 1] : 0;
                }
            }
        }
        return dp[obstacleGrid[0].length - 1];
    }

Updated 2017-12-5 : 稍微简化了一下逻辑

    public int uniquePathsWithObstacles(int[][] obstacleGrid) {
        int[] resultRow = new int[obstacleGrid[0].length];
        resultRow[0] = 1;
        for (int i = 0; i < obstacleGrid.length; i++) {
            for (int j = 0; j < obstacleGrid[0].length; j++) {
                if (obstacleGrid[i][j] == 1) {
                    resultRow[j] = 0;
                } else if (j != 0) {
                    resultRow[j] += resultRow[j - 1];
                }
            }
        }
        
        return resultRow[resultRow.length - 1];
    }

这样就把逻辑generic了