代码随想录day34 62.不同路径 63. 不同路径 II 343. 整数拆分 96.不同的二叉搜索树

代码随想录day34 62.不同路径 63. 不同路径 II 343. 整数拆分 96.不同的二叉搜索树

62.不同路径

代码随想录

class Solution {
public:
    int uniquePaths(int m, int n) {
        int dp[m][n];
        for (int i = 0; i < m; i++) {
            dp[i][0] = 1;
        }
        for (int j = 0; j < n; j++) {
            dp[0][j] = 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];
    }
};

63. 不同路径 II

代码随想录

class Solution {
public:
    int uniquePathsWithObstacles(vector<vector<int>>& obstacleGrid) {
        int row = obstacleGrid.size();
        int col = obstacleGrid[0].size();
        vector<vector<int>> dp(row, vector<int>(col));
        dp[0][0] = obstacleGrid[0][0] == 0 ? 1 : 0;
        for (int i = 1; i < row; i++) {
            if (obstacleGrid[i][0] == 1) {
                dp[i][0] = 0;
            } else {
                dp[i][0] = dp[i - 1][0];
                
            }
        }
        for (int j = 1; j < col; j++) {
            if (obstacleGrid[0][j] == 1) {
                dp[0][j] = 0;
            } else {
                dp[0][j] = dp[0][j - 1];
            }
        }
        for (int i = 1; i < row; i++) {
            for (int j = 1; j < col; j++) {
                if (obstacleGrid[i][j] == 1) {
                    dp[i][j] = 0;
                    continue;
                }
                dp[i][j] = dp[i - 1][j] + dp[i][j - 1];
            }
        }
        // for (int i = 0; i < row; i++) {
        //     for (int j = 0; j < col; j++) {
        //         cout << "dp[" << i << "][" << j << "] = " << dp[i][j] << "\t";
        //     }
        //     cout << "\n";
        // }
        return dp[row - 1][col - 1];
    }
};

343. 整数拆分

代码随想录

class Solution {
public:
    int integerBreak(int n) {
        vector<int> dp(n + 1, 0);
        dp[1] = 1;
        for (int i = 2; i <= n; i++) {
            for (int j = 1; j <= i / 2; j++) {
                dp[i] = max(max(j * (i - j), j * dp[i - j]), dp[i]);
            }
        }
        // for (int i = 1; i <= n; i++) {
        //     cout << "dp[" << i << "] = " << dp[i] << "\n";
        // }
        return dp[n];
    }
};

96.不同的二叉搜索树

代码随想录

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