LeetCode开心刷题二十九天——63. Unique Paths II**

63. Unique Paths II Medium

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?

LeetCode开心刷题二十九天——63. Unique Paths II**

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

Note: m and n will be at most 100.

Example 1:

Input:
[
  [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

BONUS:

1.for python for loop don't have actual meaning so even "_" this kinds of thing can also used in for loop

for _ in range(5):
    print(_)

 

上一篇:OpenCV Feature Detection and Description -- Harris Corner Detection Harris角点检测


下一篇:博客园界面美化三角动画、github链接和小火箭置顶代码