LeetCode-63. Unique Paths II

Description

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 1(C++)

class Solution {
public:
    int uniquePathsWithObstacles(vector<vector<int>>& obstacleGrid) {
        int m=obstacleGrid.size();
        if(m==0) return 0;
        int n=obstacleGrid[0].size();
        if(n==0) return 1;

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

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

算法分析

类似的题目可以参考：

• LeetCode-62. Unique Paths

利用动态规划来做，不是特别复杂，注意这里有障碍就行。

程序分析

略。