63. Unique Paths II

A robot is located at the top-left corner of a m x n grid (marked 'Start' in the diagram below).

The robot can only move either down or right at any point in time. The robot is trying to reach the bottom-right corner of the grid (marked 'Finish' in the diagram below).

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.

Note: m and n will be at most 100.

Example 1:

Input:
[
  [0,0,0],
  [0,1,0],
  [0,0,0]
]
Output: 2
Explanation:
There is one obstacle in the middle of the 3x3 grid above.
There are two ways to reach the bottom-right corner:
1. Right -> Right -> Down -> Down
2. Down -> Down -> Right -> Right

 

解法：

ok，第二道，这次加上了障碍。套用上一题的解法，需要判断非常多的edge case：

1、开头就是死路

2、结尾就是死路

3、只有一行

4、只有一列

我想到比较好的做法是在初始化第一行和第一列的时候直接判断初始值，只要遇到死路，后面都应该是0.

class Solution {
    public int uniquePathsWithObstacles(int[][] obstacleGrid) {
        
        int m = obstacleGrid.length;
        int n = obstacleGrid[0].length;
        
        int[][] res = new int[m][n];
        
        int sign = 1;
        for(int i=0;i<m;i++){
            if(obstacleGrid[i][0] == 1){
                sign = 0;
            }
            res[i][0] = sign; 
        }
        
        sign = 1;
        for(int i=0;i<n;i++){
            if(obstacleGrid[0][i] == 1){
                sign = 0;
            }
            res[0][i] = sign;
        }
        
        for(int i=1;i<m;i++){
            for(int j=1;j<n;j++){
                if(obstacleGrid[i-1][j] == 1){
                    res[i-1][j] = 0;
                }
                if(obstacleGrid[i][j-1] == 1){
                    res[i][j-1] = 0;
                }
                res[i][j] = res[i-1][j]+res[i][j-1];
            }
        }
        
        if(obstacleGrid[m-1][n-1] == 1)return 0;
        return res[m-1][n-1];
    }
}