leetcode63-Unique Paths II

最新推荐文章于 2023-10-19 16:08:30 发布

爱橙子的OK绷

最新推荐文章于 2023-10-19 16:08:30 发布

阅读量385

点赞数

分类专栏： leetcode 文章标签： leetcode DP

本文链接：https://blog.csdn.net/will130/article/details/50597396

版权

leetcode 专栏收录该内容

99 篇文章 0 订阅

订阅专栏

问题描述：

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.

Note: m and n will be at most 100.

方格中出现了障碍，有障碍的则不能通过。

问题求解：

class Solution {
public:
    int uniquePathsWithObstacles(vector<vector<int>>& obstacleGrid) {
        int m=obstacleGrid.size(), n=obstacleGrid[0].size();
        //path[i][j]表示达到(i,j)处所有可能方法
        vector<vector<int>> path(m, vector<int>(n, 0));//初始化为0
        for(int i=0;i<m;i++)
        {//第一列.
            if(obstacleGrid[i][0]==0)
                path[i][0]=1;//没有障碍，则path[i][0]=1;
            else //有障碍，则path[i][0]及其后边的都为0
                break;
        }
        for(int j=0;j<n;j++)
        {//第一行
            if(obstacleGrid[0][j]==0)
                path[0][j]=1;//没有障碍，则path[0][j]=1;
            else //有障碍，则path[0][j]及其后边的都为0
                break;
        }
        for(int i=1;i<m;i++)
        {
            for(int j=1;j<n;j++)
            {
                if(obstacleGrid[i][j] == 1)
                {
                    path[i][j]=0;
                }
                else
                {
                    path[i][j]=path[i-1][j]+path[i][j-1];
                }
            }
        }
        return path[m-1][n-1];
    }
};