Leetcode 算法习题 第十三周

63. 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.
[
[0,0,0],
[0,1,0],
[0,0,0]
]
The total number of unique paths is 2

题目大意

给定一个二维数组，元素若为1则代表此处不通。求从起点到终点有几条路可走。

我的解答

class Solution {
public:
    int uniquePathsWithObstacles(vector<vector<int>>& obstacleGrid) {
        int m = obstacleGrid.size();
        int n = obstacleGrid[0].size();
       vector<vector<int>> map(m, vector<int>(n, 0));//如果直接用 int map[m][n] 部分测试样例过不了。。。

        if(obstacleGrid[0][0] == 1)return 0;//如果一开始就有障碍，肯定就没路
        for(int i = 0; i<m;i++){
            if(obstacleGrid[i][0]){
                map[i][0] = 0;
                break;//如果这一行有一个障碍，剩下的路都走不通，都为0
            }
            else map[i][0] = 1;
        }
        for(int j = 0; j<n;j++){
            if(obstacleGrid[0][j]){
                map[0][j] = 0;
                break;
            }
            else map[0][j] = 1;
        }
        for(int i = 1; i<m; i++){
            for(int j = 1; j<n; j++){
                if(obstacleGrid[i][j] == 1){
                map[i][j] = 0;
            }
            else map[i][j] = map[i-1][j]+map[i][j-1];
            }
        }
        return map[m-1][n-1];
    }
};

还有一个差不多的解答：

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

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

        }
        for(int i = 1; i<m; i++){
            for(int j = 1; j<n; j++){
                if(obstacleGrid[i][j] == 0)
                map[i][j] = map[i-1][j]+map[i][j-1];
            }
        }
        return map[m-1][n-1];
    }
};