# 63. 不同路径 II

class Solution:
    def uniquePathsWithObstacles(self, obstacleGrid: List[List[int]]) -> int:
        m = len(obstacleGrid)
        n = len(obstacleGrid[0])   

        fn = [[0] * n for _ in range(m)]
        for i in range(m):
            if obstacleGrid[i][0] == 1:
                break
            fn[i][0] = 1
        
        for j in range(n):
            if obstacleGrid[0][j] == 1:
                break
            fn[0][j] = 1
        for i in range(1, m, 1):
            for j in range(1, n, 1):
                if obstacleGrid[i][j] == 1:
                    fn[i][j] = 0
                else:
                    fn[i][j] = fn[i-1][j] + fn[i][j-1]
        return fn[-1][-1]