Leetcode 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.

分析：

和第一题一样，属于动态规划里可能解个数的类型。用动态规划四步分析法分析：

1. 状态代表走到当前格的所有可能走法

2. 状态转移方程：当前格如果是障碍的话 f[i][j] = 0 是空格时有： f[i][j] = f[i-1][j] + f[i][j-1]

3. 初始化第一行第一列时要看当前格本身何其之前的格是不是障碍，只要有一个障碍就是0

4. 答案是最后finish格所有可能的路径个数

Java代码实现：

public class Solution {
    public int uniquePathsWithObstacles(int[][] obstacleGrid) {
        if(obstacleGrid==null)
            return 0;
        
        int row = obstacleGrid.length;
        int col = obstacleGrid[0].length;
        int[][] count = new int[row][col];
        if(obstacleGrid[0][0]==0)
            count[0][0] = 1;
        for(int i=1;i<row;i++)
        {
            if(obstacleGrid[i][0]==0 && count[i-1][0] == 1)
                count[i][0] = 1;
            else
                count[i][0] = 0;
        }
        for(int i=1;i<col;i++)
        {
            if(obstacleGrid[0][i]==0 && count[0][i-1] == 1)
                count[0][i] = 1;
            else
                count[0][i] = 0;
        }
        
        for(int i=1;i<row;i++)
        {
            for(int j=1;j<col;j++)
            {
                if(obstacleGrid[i][j]==0)
                    count[i][j] = count[i-1][j] + count[i][j-1];
                else
                    count[i][j] = 0;
            }
        }
        return count[row-1][col-1];
    }
}