leetcode算法题--Unique Paths II

本文主要是介绍leetcode算法题--Unique Paths II，对大家解决编程问题具有一定的参考价值，需要的程序猿们随着小编来一起学习吧！

原题链接：https://leetcode.com/problems/unique-paths-ii/

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

这篇关于leetcode算法题--Unique Paths II的文章就介绍到这儿，希望我们推荐的文章对大家有所帮助，也希望大家多多支持为之网！