115. Unique Paths II

Description

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.

m and n will be at most 100.

Example

Example 1:

Input: [[0]]

Output: 1

Example 2:

Input:  [[0,0,0],[0,1,0],[0,0,0]]

Output: 2

Explanation:

Only 2 different path.

思路：

和114题思路一致，就是多判断一个点是不是障碍，是障碍就直接跳过。

代码：