代码随想录39天|62. 不同路径、63. 不同路径 II

62. Unique Paths - 力扣（Leetcode）

class Solution {
public:
    int uniquePaths(int m, int n) {
        vector<vector<int>> dp(m, vector<int>(n, 1));
        for(vector<int>::size_type i = 1; i < n; i++) {
            for(vector<int>::size_type j = 1; j < m; j++) {
                dp[j][i] = dp[j - 1][i] + dp[j][i - 1];
            }
        }
        return dp[m - 1][n - 1];
    }
};

63. 不同路径 II - 力扣（Leetcode）

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