1335 Minimum Difficulty of a Job Schedule

Question

class Solution {
    public int minDifficulty(int[] jobDifficulty, int d) {
        if(jobDifficulty.length < d){
            return -1;
        }
        
        int n = jobDifficulty.length;
        int[][] F = new int[d+1][n+1];
        
        for(int i = 1; i <= n; i++){
            F[1][i] = Math.max(F[1][i-1], jobDifficulty[i-1]);
        }
        
        for(int i = 2; i <= d; i++){
            for(int j = i; j <= n; j++){
                F[i][j] = Integer.MAX_VALUE;
                int currMax = 0;
                for(int k = j; k >= i; k--){
                    currMax = Math.max(currMax, jobDifficulty[k-1]);
                    F[i][j] = Math.min(F[i][j], F[i-1][k-1] + currMax);
                }
            }
        }
        
        return F[d][n];
    }
}