代码随想录算法训练营day34|动态规划part2

不同路径

力扣题目链接

class Solution {
public:
    int uniquePaths(int m, int n) {
        vector<vector<int>> dp(m, vector<int>(n, 1));
        for(int i = 1; i < m; i++){
            for(int j = 1; j < n; j++){
                dp[i][j] = dp[i-1][j] + dp[i][j-1]; 
            }
        }
        return dp[m-1][n-1];
    }
};

不同路径 II

力扣题目链接

class Solution {
public:
    int uniquePathsWithObstacles(vector<vector<int>>& obstacleGrid) {
        int m = obstacleGrid.size();
        int n = obstacleGrid[0].size();
        vector<vector<int>> dp(m, vector<int>(n, 0));
        int i = 0;
        while(i < m && obstacleGrid[i][0] != 1){
            dp[i][0] = 1;
            ++i;
        }
        i = 1;
        while(i < n && obstacleGrid[0][i] != 1){
            dp[0][i] = 1;
            ++i;
        }
        for(i = 1; i < m; i++){
            for(int j = 1; j < n; j++){
                if(obstacleGrid[i][j] == 1)
                    continue;
                dp[i][j] = dp[i-1][j] + dp[i][j-1];
            }
        }
        return dp[n-1][m-1];
    }
};

整数拆分

力扣题目链接

class Solution {
public:
    int integerBreak(int n) {
        vector<int> dp(n+1, 0);
        dp[1] = 1;
        dp[2] = 1;
        int temp = 1;
        for(int i = 2; i <= n; i++){
            for(int j = 1; j <= i/2; j++){
                // 拆分时2,3会导致dp变小
                temp = max(temp, max(dp[j],j) * max(dp[i-j], i-j));
            }
            dp[i] = temp;
        }
        return dp[n];
    }
};

不同的二叉搜索树

力扣题目链接

class Solution {
public:
    int numTrees(int n) {
        vector<int> dp(n+1, 0);
        dp[0] = 1;
        dp[1] = 1;
        for(int i = 2; i <= n; i++){
            for(int j = 1; j <= i; j++){
                // j当头节点，左边j-1，右边i-j
                dp[i] += dp[j-1] * dp[i-j];
            }
        }
        return dp[n];
    }
};