LeetCode 63.Unique Paths II

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.

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

解题思路

• dfs

• ‘dp

  动态规划的方法解题，基于62题的思路，其实就是一个题，思路比较简单，在第一行 或者第一列出现障碍的话那么，障碍之后的路径方法为0，在其他有障碍位置的也是为0，可行的路径根据左边和上边相加即可。

解题代码

class Solution {
public:
    int uniquePathsWithObstacles(vector<vector<int>>& grid) {
        int m = grid.size(), n = grid[0].size();
        vector<vector<long>> dp(m, vector<long>(n, 0)); 
        for (int i = 0; i < m; i++){
            if (grid[i][0]) break;
            dp[i][0] = 1;
        }
        for (int i = 0; i < n; i++){
            if (grid[0][i]) break;
            dp[0][i] = 1;
        }
        for (int i = 1; i < m ; i++)
            for (int j = 1; j < n; j++)
                if (!grid[i][j]) dp[i][j] = dp[i - 1][j] + dp[i][j - 1];
        return dp[m - 1][n - 1];
    }
};

改进的代码参考于这里：

class Solution {
public:
    int uniquePathsWithObstacles(vector<vector<int> > &obstacleGrid) {
        int m = obstacleGrid.size() , n = obstacleGrid[0].size();
        vector<vector<long>> dp(m + 1, vector<long>(n + 1, 0));
        dp[0][1] = 1;
        for (int i = 1 ; i <= m ; i++)
            for (int j = 1 ; j <= n ;j++)
                if (!obstacleGrid[i - 1][j - 1])
                    dp[i][j] = dp[i - 1][j]+dp[i][j - 1];
        return dp[m][n];
    }
};