【JAVA】746. 使用最小花费爬楼梯 | 62.不同路径 | 63. 不同路径 II | 343. 整数拆分

class Solution {
    public int minCostClimbingStairs(int[] cost) {
        //初始化
        int[] dp = new int[cost.length + 1];
        dp[0] = 0;
        dp[1] = 0;
        //循环
        for(int i = 2; i<=cost.length; i++){
            dp[i] = Math.min(dp[i-1] + cost[i-1] , dp[i-2] + cost[i-2]);
        }
        return dp[cost.length];
    }
}

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

class Solution {
    public int uniquePathsWithObstacles(int[][] obstacleGrid) {
        int m = obstacleGrid.length;
        int n = obstacleGrid[0].length;
        int[][] dp = new int[m][n];
        for(int i = 0 ; i<m && obstacleGrid[i][0] == 0; i++){
            dp[i][0] = 1;
        }
        for(int i = 0 ; i<n && obstacleGrid[0][i] == 0; i++){
            dp[0][i] = 1;
        }
        for(int i = 1 ; i<m; i++){
            for(int j = 1 ; j<n; j++){
                dp[i][j] = (obstacleGrid[i][j] == 0) ? dp[i-1][j] + dp[i][j-1] : 0;
            }
        }
        return dp[m-1][n-1];
    }
}

class Solution {
    public int integerBreak(int n) {
        int[] dp = new int[n+1];
        dp[2] = 1;
        for(int i = 3 ; i<=n ; i++){
            for(int j = 1 ; j<=i-j ; j++){
                dp[i] = Math.max(dp[i] , Math.max(j*dp[i-j], j*(i-j)));
            }  
        }
        return dp[n];
    }
}