Leetcode 63. Unique Paths II (Medium) (cpp)

Leetcode 63. Unique Paths II (Medium) (cpp)

Tag: Array, Dynamic Programming

Difficulty: Medium

/*

63. Unique Paths II (Medium)

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.

Note: m and n will be at most 100.

*/
class Solution {
public:
    int uniquePathsWithObstacles(vector<vector<int>>& obstacleGrid) {
        if (obstacleGrid.empty()) {
            return 0;
        }
        int _size = obstacleGrid[0].size();
        vector<int> res(_size, 0);
        res[0] = 1;
        for (int i = 0; i < obstacleGrid.size(); i++) {
            for (int j = 0; j < _size; j++) {
                if (obstacleGrid[i][j] == 1) {
                    res[j] = 0;
                } else if (j > 0) {
                    res[j] = res[j - 1] + res[j];
                }
            }
        }
        return res[_size - 1];
    }
};