LeetCode 63

原题:

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.

题意：在上一题基础上加上障碍，判断可达总路径数，上图中点为1的就是障碍

代码和思路：

class Solution {
    public int uniquePathsWithObstacles(int[][] obstacleGrid) {
        //行数
        int m = obstacleGrid.length;
        //列数
        int n = obstacleGrid[0].length;
        
        int [] [] grid = new int [m][n];
        
        //如果入口就有障碍，返回0
        if(obstacleGrid[0][0] == 1){
            return 0;
        }
        //入口一种走法
        grid[0][0] = 1;
        
        //左边界，如果上一格走法不为0且这一点没有障碍物
        for(int i = 1; i < m; i++){
            if(grid[i-1][0]!=0 && obstacleGrid[i][0] !=1){
                grid[i][0] = 1;
            }
        }
        //上边界，如果左一格走法不为0且这一点没有障碍物
        for(int i = 1; i < n; i++){
            if(grid[0][i-1]!=0 && obstacleGrid[0][i]!=1){
                grid[0][i] = 1;
            }
        }
        //与上一题一样，中间部分加上判断是否有障碍
        for(int i = 1; i<m; i++){
            for(int j=1; j<n; j++){
                if(obstacleGrid[i][j]!=1){
                    grid[i][j] = grid[i-1][j] + grid[i][j-1];
                }
            }
        }
        return grid[m-1][n-1];
    }
}