We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent 989fcad commit 51a2288Copy full SHA for 51a2288
1335.工作计划的最低难度.js
@@ -0,0 +1,27 @@
1
+/**
2
+ * @param {number[]} jobDifficulty
3
+ * @param {number} d
4
+ * @return {number}
5
+ */
6
+var minDifficulty = function(jobDifficulty, d) {
7
+ const dp = [];
8
+
9
+ dp[0] = [jobDifficulty[0]];
10
+ for (let i = 1; i < jobDifficulty.length; i++) {
11
+ dp[0][i] = Math.max(dp[0][i- 1], jobDifficulty[i]);
12
+ }
13
14
+ for (let i = 1; i < d; i++) {
15
+ dp[i] = [];
16
+ for (let j = i; j < jobDifficulty.length; j++) {
17
+ dp[i][j] = dp[i - 1][j - 1] + jobDifficulty[j];
18
+ let max = jobDifficulty[j];
19
+ for (let k = j - 1; k >= i; k--) {
20
+ max = Math.max(max, jobDifficulty[k]);
21
+ dp[i][j] = Math.min(dp[i][j], dp[i - 1][k - 1] + max);
22
23
24
25
26
+ return dp[d - 1][jobDifficulty.length - 1] || -1;
27
+};
0 commit comments