代码随想录算法训练营第33天｜62.不同路径、63. 不同路径 II、343. 整数拆分、96.不同的二叉搜索树

62.不同路径

leetcode 62.不同路径
代码随想录

记住当前位置可以从右边和上面过来，对应的状态转移方程就是 dp[i][j] = d[i-1][j] + dp[i][j-1].

class Solution:
    def uniquePaths(self, m: int, n: int) -> int:
        dp = [[0 for _ in range(n)] for _ in range(m)]
        
        for i in range(n):
            dp[0][i] = 1
        for i in range(m):
            dp[i][0] = 1
        # print(dp)
        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[-1][-1]

63. 不同路径 II

leetcode 63. 不同路径 II
代码随想录

遇到有障碍就把这个位置路径置为零；初始化的时候，如果遇到了障碍，后面的所有都需要置为零。
让状态转移和上面的不同路径保持一致就好了。

class Solution:
    def uniquePathsWithObstacles(self, obstacleGrid: List[List[int]]) -> int:
        # if obstacleGrid[i][j]==1: dp[i][j] = 0 
        # 初始化的时候某一个元素等于0了之后后面的全部要赋值为零
        m, n =  len(obstacleGrid) , len(obstacleGrid[0])
        # dp = [[0 for _ in range(n)] for _ in range(m)]
        dp = [[0]*n for _ in range(m)]
        # 初始化第一行和第一列
        flag = False
        for i in range(n):
            if flag:
                dp[0][i] = 0
            elif obstacleGrid[0][i] == 1:
                flag = True
                dp[0][i] = 0
            else:
                dp[0][i] = 1
        # print(dp)
        flag = False
        for i in range(m):
            if flag:
                dp[i][0] = 0
            elif obstacleGrid[i][0] == 1:
                flag = True
                dp[i][0] = 0
            else:
                dp[i][0] = 1
        # print(dp)
        for i in range(1,m):
            for j in range(1, n):
                if obstacleGrid[i][j] == 1:
                    dp[i][j] = 0
                else:
                    dp[i][j] = dp[i-1][j] + dp[i][j-1]
        return dp[-1][-1]

343. 整数拆分

leetcode 343. 整数拆分
代码随想录

class Solution:
    def integerBreak(self, n: int) -> int:
        # dp[i]就表示为i的时候的最大和
        # dp[i] = max(dp[k] * dp[i - k])
        dp = [0] * (n + 1)
        dp[1] = 1
        for i in range(2, n + 1, 1):
            for j in range(1, i, 1):
                dp[i] = max(dp[i], max(j * (i-j), j * dp[i-j]))
        return dp[-1]

96.不同的二叉搜索树

leetcode 96.不同的二叉搜索树
代码随想录

dp[i] 有i个节点的时候可以组成的二叉搜索树
当j为根节点的时候，这种情况下的方式左右节点个数组成方式相乘 dp[j-1] * dp[i-j]

class Solution:
    def numTrees(self, n: int) -> int:
        if n == 1:
            return 1
        dp = [0] * (n+1)
        dp[0] = 1
        dp[1] = 1
        for i in range(2, n+1):
            for j in range(1,i+1):
                dp[i] += dp[j-1] * dp[i-j]
        return dp[-1]