63. Unique Paths II

#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.

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

这道题的意思是，有一个机器人要从左上角走到右下角，他只能向右或者向下走，并且路上会有障碍。问最多有多少种不同的路径。
使用动态规划来做。机器人到达每一个地方的状态是由它从左边走过来的状态和从上边走过来的状态的和。初始化的状态是矩阵的四条边。最后返回的是dp[m-1][n-1]

var uniquePathsWithObstacles = function(obstacleGrid) {
    let m = obstacleGrid.length;
    let n = obstacleGrid[0].length;
    let dp = new Array(m);
    for(let i=0;i<m;i++) {
        dp[i] = new Array(n);
    }
    for(let i=0;i<m;i++) {
        for(let j=0;j<n;j++) {
            dp[i][j] = 0;
        }
    }
    if(obstacleGrid[0][0] === 1) {
        return 0;
    }
    dp[0][0] = 1;
    for(let i=1;i<n;i++) {
        if(obstacleGrid[0][i] === 1 ||dp[0][i-1]===0) {
            dp[0][i] = 0;
        }
        else {
            dp[0][i] = 1;
        }
    }
    for(let i=1;i<m;i++) {
        if(obstacleGrid[i][0] === 1 || dp[i-1][0]===0) {
            dp[i][0] = 0;
        }
        else {
            dp[i][0] = 1;
        }
    }
    for(let i=1;i<m;i++) {
        for(let j=1;j<n;j++) {
            if(obstacleGrid[i][j] === 1) {
                dp[i][j] = 0;
            }
            else {
                dp[i][j] = dp[i-1][j]+dp[i][j-1];
            }
        }
    }
    return dp[m-1][n-1];
};