【一天一道LeetCode】#63. Unique Paths II

最新推荐文章于 2024-10-13 15:10:00 发布

ZeeCoder

最新推荐文章于 2024-10-13 15:10:00 发布

阅读量3.4k

点赞数

分类专栏： LeetCode 一天一道LeetCode 文章标签： leetcode

本文链接：https://blog.csdn.net/terence1212/article/details/51504344

版权

LeetCode 同时被 2 个专栏收录

166 篇文章 0 订阅

订阅专栏

一天一道LeetCode

165 篇文章 36 订阅

订阅专栏

一天一道LeetCode

（一）题目

Follow up for “Unique Paths”:

Now consider if some obstacles are added to the grids. How many unique paths would there be?

An obstacle and empty space is marked as 1 and 0 respectively in the grid.

For example,

There is one obstacle in the middle of a 3x3 grid as illustrated below.

[

[0,0,0],

[0,1,0],

[0,0,0]

]

The total number of unique paths is 2.

（二）解题

解题思路：参考上一篇博文【一天一道LeetCode】#62. Unique Paths


class Solution {

public:

    int dp[101][101];

    int uniquePathsWithObstacles(vector<vector<int>>& obstacleGrid) {

        int row = obstacleGrid.size();

        int col = 0;

        if(row!=0) col = obstacleGrid[0].size();

        if(obstacleGrid[0][0]==1) return 0;//起始点不通则直接返回0

        for(int i = row-1 ; i>=0 ; i--)

            for(int j = col-1 ; j>=0 ; j--)

            {

                if(obstacleGrid[i][j]==1) dp[i][j] = 0;//代表此路不通

                else if(i==row-1&&j==col-1) dp[i][j] = 1;//规定终点的dp为1

                else dp[i][j] = dp[i+1][j]+dp[i][j+1];

            }

        return dp[0][0];

    }