Unique Paths II (Java)

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.

遇到障碍后，dp[i][j] = 0，这道题不知道用给dp集体赋值的方法怎么做，只知道先根据grid赋值dp的上边界和右边界，由于是数组的边缘，所以只有一种到达的路径，假如grid显示有障碍，那么后面的所有都不可达。

Source

public class Solution {
      public int uniquePathsWithObstacles(int[][] obstacleGrid) {
    	int m = obstacleGrid.length, n = obstacleGrid[0].length;
    	if(m == 0) return 0;
    	if(obstacleGrid[0][0] == 1 || obstacleGrid[m - 1][n - 1] == 1) return 0; //***
    	
        int[][] dp = new int[m][n];
        
        dp[0][0] = 1;
        for(int i = 1; i < m; i++){
        	if(obstacleGrid[i][0] == 0)
        		dp[i][0] = dp[i - 1][0];  //延续上一个的状态，如果上一个是0，下一个也是0，即遇到障碍后面的走法都为0
        	else dp[i][0] = 0;
        }
        
        for(int j = 1; j < n; j++){
        	if(obstacleGrid[0][j] == 0)
        		dp[0][j] = dp[0][j - 1];
        	else dp[0][j] = 0;
        }
        
        for(int i = 1; i < m; i++){
        	for(int j = 1; j < n; j++){
        		if(obstacleGrid[i][j] != 1){
        			dp[i][j] = dp[i - 1][j] + dp[i][j - 1];
        		}
        		else dp[i][j] = 0;
        	}
        }
        return dp[m - 1][n - 1];
    }
}

Test

    public static void main(String[] args){
    	int[][] a = {{0,0,0},{0,1,0},{0,0,0}};
    	System.out.println(new Solution().uniquePathsWithObstacles(a));
    }