LeetCode63. 不同路径 II

当如磐石

于 2020-07-06 23:55:55 发布

阅读量69

点赞数

分类专栏： LeetCode刷题

本文链接：https://blog.csdn.net/oykotxuyang/article/details/107171149

版权

LeetCode刷题专栏收录该内容

77 篇文章 0 订阅

订阅专栏

63. 不同路径 II

class Solution {
public:
    int uniquePathsWithObstacles(vector<vector<int>>& obstacleGrid) {
        int len1 = obstacleGrid.size();
        if(len1 < 1) return 0;
        int len2 = obstacleGrid[0].size();
        vector<vector<long>> dp(len1, vector<long>(len2, 0));    //int会溢出
        //边界
        int i = 0;
        while(i < len1 && obstacleGrid[i][0] != 1)
            dp[i++][0] = 1;
        for(i; i < len1; i++) dp[i][0] = 0;
        int j = 0;
        while(j < len2 && obstacleGrid[0][j] != 1)
            dp[0][j++] = 1;
        for(j; j < len2; j++) dp[0][j] = 0;
        for(int m = 1; m < len1; m++){
            for(int n = 1; n < len2; n++){
                if(obstacleGrid[m][n] == 0) dp[m][n] = dp[m-1][n]+dp[m][n-1];// obstacleGrid[m][n]==0写成了dp[m][n]==0
                else dp[m][n]=0;                                               //在VS下才调出来，┭┮﹏┭┮┭┮﹏┭┮
            }
        }
        return dp[len1-1][len2-1];
    }
};