[LeetCode]63. Unique Paths II

Problem Description

[https://leetcode.com/problems/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.

思路

DP！
dp[i][j]表示到(i,j)位置有多少种走法。
dp[i][j]=dp[i-1][j]*obstacleGrid[i][j]+dp[i][j-1]*obstacleGrid[i][j];

Code

package q063;

public class Solution {
    public int uniquePathsWithObstacles(int[][] obstacleGrid) {
        int m = obstacleGrid.length;
        int n = obstacleGrid[0].length;
        int[][] dp = new int[m][n];
        if (obstacleGrid[0][0] == 1)
            return 0;

        for (int i = 0; i < m; i++) {
            for (int j = 0; j < n; j++) {
                dp[i][j] = 0;
            }
        }
        dp[0][0] = 1;
        for (int i = 0; i < m; i++) {
            for (int j = 0; j < n; j++) {
                if (i >= 1 && obstacleGrid[i][j] != 1) {
                    dp[i][j] += dp[i - 1][j];
                }
                if (j >= 1 && obstacleGrid[i][j] != 1) {
                    dp[i][j] += dp[i][j - 1];
                }

            }
        }

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

}