代码训练营第42天：动态规划part2｜leetcode62不同路径｜leetcode63不同路径2

leetcode62：不同路径

文章讲解：leetcode62

leetcode63：不同路径2

文章讲解：leetcode63

目录

1，leetcode62 不同路径

2，leetcode63 不同路径2

---

1，leetcode62 不同路径

由于每次只能往下或者往右边走，其实相当于是到每个格子的方案等于到上面的加上到左边的，即

dp[i][j] = dp[i-1][j]+dp[i][j-1];和昨天的那几道题差不多。

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

2，leetcode63 不同路径2

和上面那道题区别在于确定在障碍的下方和右边的方案数量。在障碍的下方，意味着只能从左边过来，

dp[i][j]=dp[i-1][j];

同理，另一个是

dp[i][j] = dp[i][j-1]

其他部分保持一致。

class Solution {//过不了的
public:
    int uniquePathsWithObstacles(vector<vector<int>>& obstacleGrid) {
        int m = obstacleGrid.size();
        int n = obstacleGrid[0].size();
        vector<vector<int>> dp(m, vector<int>(n, 0));
        if(obstacleGrid[m-1][n-1]==1||obstacleGrid[0][0]==1)return 0;
        else if(m>1&&n>1&&obstacleGrid[1][0]==1&&obstacleGrid[0][1]==1)return 0;
        dp[0][0] = 1;
        for (int i = 1; i < m; i++){
            if(obstacleGrid[i-1][0]==1)dp[i][0] = 0;
            else dp[i][0]=1;
        }
        for (int j = 1; j < n; j++){
            if(obstacleGrid[0][j-1]==1)dp[0][j] = 0;
            else dp[0][j]=1;
        }
        for (int i = 1; i < m; i++) {
            for (int j = 1; j < n; j++) {
                if(obstacleGrid[i-1][j]==1&&obstacleGrid[i][j-1]==1){
                    dp[i][j]==0;
                }
                else if(obstacleGrid[i-1][j]==1){
                    dp[i][j] = dp[i][j-1];
                }else if(obstacleGrid[i][j-1]==1){
                    dp[i][j] = dp[i-1][j];
                }else{
                    dp[i][j] = dp[i - 1][j] + dp[i][j - 1];
                } 
            }
        }
        return dp[m - 1][n - 1];
    }
};

实际做的时候发现很多数据点过不了，陷入了加入if来特判的循环怪圈。

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

其实只是有一点没想通,针对障碍的处理没想明白就导致思路整个走歪了。