63. Unique Paths II[dp]

最新推荐文章于 2024-07-25 09:04:50 发布

FreeeLinux

最新推荐文章于 2024-07-25 09:04:50 发布

阅读量442

点赞数

CC 4.0 BY-SA版权

分类专栏： Leetcode

本文链接：https://blog.youkuaiyun.com/FreeeLinux/article/details/64462197

Leetcode 专栏收录该内容

64 篇文章

订阅专栏

本文探讨了在一个包含障碍物的网格中寻找从起点到终点的不同路径数量的问题。特别地，我们考虑了一个3x3的网格，其中网格中的空位用0表示，障碍物用1表示。举例来说，在一个中间有一个障碍物的3x3网格中，从左上角到右下角的不同路径总数为2。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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.

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.