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.

解题思路：

0	0	0	0	0
0	1	1	0	1
0	0	0	0	0

2	1	1	1	0
1	0	0	1	0
1	1	1	1	1

public int uniquePathsWithObstacles(int[][] obstacleGrid) {
          if(obstacleGrid == null) return 0;
          
          int xlen = obstacleGrid.length;
          int ylen = obstacleGrid[0].length;
          if(obstacleGrid[xlen-1][ylen-1] == 1)
            return 0;
          
          int arr[][] = new int[xlen][ylen];
          
          arr[xlen-1][ylen-1] = 1;
          
          for(int i = xlen-2; i >= 0; i --){
              if(obstacleGrid[i][ylen-1] != 1)
                arr[i][ylen-1] = arr[i+1][ylen-1];
            else 
                 arr[i][ylen-1] = 0;
            
          }
          
          for(int j = ylen-2; j >= 0; j --){
              if(obstacleGrid[xlen-1][j] != 1)
                arr[xlen-1][j] = arr[xlen-1][j+1];
              else
                arr[xlen-1][j] = 0;
          }
          
          for(int i = xlen-2; i >= 0; i --){
              for(int j = ylen-2; j >= 0; j --){
                  if(obstacleGrid[i][j] == 1){
                      arr[i][j] = 0;
                      continue;
                  }
                  arr[i][j]=arr[i+1][j]+arr[i][j+1];
              }
          }
               
          return arr[0][0];             
    }