LeetCode - Unique Paths II

Posted 2021-01-24 IncredibleThings

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

注意有bloack之后的计算条件：

class Solution {
    public int uniquePathsWithObstacles(int[][] obstacleGrid) {
        if(obstacleGrid == null || obstacleGrid.length ==0 || obstacleGrid[0].length == 0){
            return -1;
        }
        int r = obstacleGrid.length;
        int c = obstacleGrid[0].length;
        int[][] dp =new int[r][c];
        if(obstacleGrid[0][0] == 1){
            return 0;
        }
        dp[0][0] = 1;
        
        
        //
        for(int i = 1; i < r; i++){
            if(obstacleGrid[i][0] == 0 && dp[i-1][0] == 1){
                dp[i][0] = 1;
            }
            else {
                dp[i][0] = 0;
            }
        }
        
        for(int j = 1; j < c; j++){
            if(obstacleGrid[0][j] == 0 && dp[0][j-1] == 1){
                dp[0][j] = 1;
            }
            else {
                dp[0][j] = 0;
            }
        }
        
        for(int i = 1; i < r; i++){
            for(int j = 1; j < c; j++){

                if (obstacleGrid[i][j] == 0){
                    dp[i][j] = dp[i][j-1] + dp[i-1][j];
                }
                else{
                    dp[i][j] = 0;
                }
                
            }
            
        }
        return dp[r-1][c-1];
    }
}