Steward

分享是一種喜悅、更是一種幸福

程式語言 - LeetCode - C++ - 63. Unique Paths II

---

參考資訊：
https://www.cnblogs.com/grandyang/p/4353680.html

題目：


解答：

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

        vector<vector<int>> dp(m + 1, vector<int>(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]) {
                    continue;
                }

                dp[i][j] = dp[i - 1][j] + dp[i][j - 1];
            }
        }
 
        return dp[m][n];
    }
};