LeetCode||63. Unique Paths II

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.

Note: m and n will be at most 100.

和上一题一样，不过，这题加了障碍，障碍其实就0，继续相加即可

如例子所讲，矩阵长这样

[
  [1,1,1],
  [1,0,1],
  [1,1,2]
]

class Solution(object):
    def uniquePathsWithObstacles(self, obstacleGrid):
        """
        :type obstacleGrid: List[List[int]]
        :rtype: int
        """
        row = len(obstacleGrid)
        col = len(obstacleGrid[0])
        res = [[0 for i in range(col)] for j in range(row)]
        for i in range(row):
        	if obstacleGrid[i][0] == 0:
        		res[i][0] = 1
        	else:
        		res[i][0] = 0
        		break
        for i in range(col):
        	if obstacleGrid[0][i]==0:
        		res[0][i] = 1
        	else:
        		res[0][i] = 0
        		break
        for i in range(1, row):
        	for j in range(1, col):
        		if obstacleGrid[i][j] == 1:
        			res[i][j] = 0
        		else:
        			res[i][j] = res[i][j-1] + res[i-1][j]
        return res[-1][-1]