Looking for good programming challenges?

Use the search below to find our solutions for selected questions!

Unique Paths II

Sharing is caring!

Problem Statement
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
Solution
class Solution {
    public int uniquePathsWithObstacles(int[][] obstacleGrid) {
        final int OBSTACLE = 1;
        
        int n = obstacleGrid.length;
        int m = obstacleGrid[0].length;
        int[][] dp = new int[n][m];
        
        if (obstacleGrid[0][0] == OBSTACLE) {
            dp[0][0] = 0;
        } else {
            dp[0][0] = 1;
        }
        
        for (int i=1; i<n; i++) {
            if (obstacleGrid[i][0] == OBSTACLE) {
                dp[i][0] = 0;
            } else {
                dp[i][0] = Math.min(dp[i-1][0], 1);
            }
        }
        
        for (int j=1; j<m; j++) {
            if (obstacleGrid[0][j] == OBSTACLE) {
                dp[0][j] = 0;
            } else {
                dp[0][j] = Math.min(dp[0][j-1], 1);
            }
        }
        
        for (int i=1; i<n; i++) {
            for (int j=1; j<m; j++) {
                if (obstacleGrid[i][j] == OBSTACLE) {
                    dp[i][j] = 0;
                } else {
                    if (dp[i-1][j] > 0 && dp[i][j-1] > 0) {
                        dp[i][j] = dp[i-1][j] + dp[i][j-1];
                    }else if (dp[i-1][j] > 0) {
                        dp[i][j] = dp[i-1][j];
                    } else if (dp[i][j-1] > 0) {
                        dp[i][j] = dp[i][j-1];
                    } else {
                        dp[i][j] = 0;
                    }
                }
            }
        }

        
        return dp[n-1][m-1];
    }
}