63. Unique Paths II

最新推荐文章于 2024-10-03 23:42:25 发布

soO_007

最新推荐文章于 2024-10-03 23:42:25 发布

阅读量100

点赞数

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

本文链接：https://blog.csdn.net/weixin_49991368/article/details/123387871

版权

LeetCode 专栏收录该内容

223 篇文章 1 订阅

订阅专栏

题目：

A robot is located at the top-left corner of a m x n grid (marked 'Start' in the diagram below).

The robot can only move either down or right at any point in time. The robot is trying to reach the bottom-right corner of the grid (marked 'Finish' in the diagram below).

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

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

Example 1:

Input: obstacleGrid = [[0,0,0],[0,1,0],[0,0,0]]
Output: 2
Explanation: There is one obstacle in the middle of the 3x3 grid above.
There are two ways to reach the bottom-right corner:
1. Right -> Right -> Down -> Down
2. Down -> Down -> Right -> Right

Example 2:

Input: obstacleGrid = [[0,1],[0,0]]
Output: 1

Constraints:

m == obstacleGrid.length
n == obstacleGrid[i].length
1 <= m, n <= 100
obstacleGrid[i][j] is 0 or 1.

思路：

dp题，只不过路径上有阻碍。dp[i][j]表示走到这一格有几种走法。初始化当j等于0或者i等于0时要注意前面如果有障碍，则对应纵向或则横向后面的都为0。之后就是正常遍历，dp[i][j]在grid[i][j]不为1的情况下，要么从上一格来，要么从左一格来。最后返回答案即可。

代码：

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