LeetCode/solutions/cpp/0063.cpp at master · SnistAheads/LeetCode · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
class Solution {
public:
    int uniquePathsWithObstacles(vector<vector<int>>& obstacleGrid) {
        if (obstacleGrid.empty() || obstacleGrid[0][0]) return 0;

        const int m = obstacleGrid.size();
        const int n = obstacleGrid[0].size();

        vector<vector<long>> dp(m, vector<long>(n));
        dp[0][0] = 1;

        for (int i = 1; i < m; i++)
            if (!obstacleGrid[i][0])
                dp[i][0] = dp[i - 1][0];

        for (int j = 1; j < n; j++)
            if (!obstacleGrid[0][j])
                dp[0][j] = dp[0][j - 1];

        for (int i = 1; i < m; i++)
            for (int j = 1; j < n; j++)
                if (!obstacleGrid[i][j])
                    dp[i][j] = dp[i - 1][j] + dp[i][j - 1];

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