【DP】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]
]

注意：边缘元素除了0,0都要通过前面的元素推出来

public class Solution {
    public int uniquePathsWithObstacles(int[][] obstacleGrid) {
        int len1 = obstacleGrid.length;
        if(len1 == 0) return 0;
        int len2 = obstacleGrid[0].length;
        if(len2 == 0) return 0;
        
        if(obstacleGrid[0][0] == 1) return 0;
        
        int d[][] = new int[len1][len2];
        
        for(int i=0; i<len1; i++){
            for(int j=0; j<len2; j++){
                if(obstacleGrid[i][j] == 0){
                    if(i==0 && j==0) d[i][j] = 1;//边缘元素除了0,0都要通过前面的元素推出来
                    else{
                        d[i][j] = (i==0 ? 0 : d[i-1][j]) + (j==0 ? 0 : d[i][j-1]);
                        
                    }
                }
                else d[i][j] = 0;
            }
        }
        
        return d[len1-1][len2-1];
    }
}