代码随想录算法训练营第39天| 62. 不同路径、63. 不同路径 II

62. 不同路径:

---

代码思路
状态转移方程（递推式）先想出来就没问题啦

class Solution:
    def uniquePaths(self, m: int, n: int) -> int:
        dp = [[0 for i in range(n)] for i in range(m)]
        for i in range(n):
            dp[0][i] = 1
        for i in range(m):
            dp[i][0] = 1
        
        for m_num in range(1, m):
            n_num = 1
            while n_num < n:
                dp[m_num][n_num] = dp[m_num-1][n_num]+dp[m_num][n_num-1]
                n_num += 1
        return dp[m-1][n-1]

63. 不同路径 II:

---

代码思路
比上面的题加了亿点点条件

class Solution:
    def uniquePathsWithObstacles(self, obstacleGrid: List[List[int]]) -> int:
        dp = obstacleGrid.copy()
        for i in range(len(obstacleGrid)):
            for j in range(len(obstacleGrid[i])):
                if obstacleGrid[i][j] == 1:
                    dp[i][j] = -1
        for i in range(1,len(dp)):
            if dp[i][0] == -1:
                continue
            elif dp[i-1][0] == -1:
                dp[i][0] = -1
            else:
                dp[i][0] = 1
        for i in range(1,len(dp[0])):
            if dp[0][i] == -1:
                continue
            elif dp[0][i-1] == -1:
                dp[0][i] = -1
            else:
                dp[0][i] = 1       
        for i in range(1, len(dp)):
            j = 1
            while j < len(dp[0]):
                if dp[i][j] == -1:
                    j += 1
                    continue
                
                elif dp[i-1][j] == -1:
                    if dp[i][j-1] != -1:
                        dp[i][j] = dp[i][j-1]
                    else:
                        dp[i][j] = -1
                elif dp[i][j-1] == -1:
                    
                    dp[i][j] = dp[i-1][j]

                else:    
                    dp[i][j] = dp[i-1][j] + dp[i][j-1]
                j += 1
        if dp[-1][-1] == 0:
            return 1
        return 0 if dp[-1][-1] == -1 else dp[-1][-1]