本文探讨了一个3x3网格中存在障碍物的情况下，从左上角到右下角的不同路径数量问题。通过动态规划的方法，考虑到障碍物的存在，计算出唯一路径的数量为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 3 × 3 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.
扫一扫
11-18
1015
1015
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
