代码随想录训练营第III期--039--python

# 代码随想录训练营第III期--039--python

#  62.不同路径 
class Solution:
    def unique(self, n,m):
        dp = [[0] * (n+1)] * (m + 1)

        for i in range(m+1):
            dp[i][0] = 1
        for j in range(n+1):
            dp[0][j] = 1 

        for i in range(1, m):
            for j in range(1, n):
                dp[i][j] = dp[i-1][j] + dp[i][j-1]

        return dp[m-1][n-1]

#  63. 不同路径 II 
class Solution:
    def uniquePathsWithObstacles(self, obstacleGrid: List[List[int]]) -> int:
        m = len(obstacleGrid)
        n = len(obstacleGrid[0])

        # dp = [[0] * (n)] * (m) # 这个总错，还没搞清楚，在问了
        dp = [[0 for _ in range(n)] for _ in range(m)]

        if obstacleGrid[0][0] == 0:
            dp[0][0] = 1
        else:
            dp[0][0] = 0
            return 0

        for i in range(1,m):
            if obstacleGrid[i][0] == 1:
                break 
            dp[i][0] = 1 

        for j in range(1,n):
            if obstacleGrid[0][j] == 1:
                break 
            dp[0][j] = 1 

        for i in range(1, m):
            for j in range(1, n):
                if obstacleGrid[i][j] == 0:
                    dp[i][j] = dp[i-1][j] + dp[i][j-1] 
        return dp[m-1][n-1]