七月day31——动态规划

leetcode.63 不同路径Ⅱ

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

        if (obstacleGrid[0][0] == 1 || obstacleGrid[m-1][n-1] == 1) return 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];
    }
};
/*
1.确定dp[i][j] 为目的地为i，j 路径数目 有障碍物的dp[i][j] = 0
2.确定递推关系式 dp[i][j] = dp[i-1][j] + dp[i][j-1]
3.初始化 dp[0][j] = 1 dp[i][0] = 1 碰到障碍物则为0
4.遍历顺序 从左往右 从上往下 初始为i=1 j=1
5.举例验证
*/