add 1335

Author: luliyucoordinate

README.md

@@ -627,4 +627,5 @@ LeetCode
 |1331|[Rank Transform of an Array](https://leetcode.com/problems/rank-transform-of-an-array/)|c|[c++](./src/1331-Rank-Transform-of-an-Array/1331.cpp)|[python](./src/1331-Rank-Transform-of-an-Array/1331.py)|[go](./src/1331-Rank-Transform-of-an-Array/1331.go)|[js](./src/1331-Rank-Transform-of-an-Array/1331.js)|[java](./src/1331-Rank-Transform-of-an-Array/1331.java)|Easy|
 |1332|[Remove Palindromic Subsequences](https://leetcode.com/problems/remove-palindromic-subsequences/)|c|[c++](./src/1332-Remove-Palindromic-Subsequences/1332.cpp)|[python](./src/1332-Remove-Palindromic-Subsequences/1332.py)|[go](./src/1332-Remove-Palindromic-Subsequences/1332.go)|[js](./src/1332-Remove-Palindromic-Subsequences/1332.js)|[java](./src/1332-Remove-Palindromic-Subsequences/1332.java)|Easy|
 |1333|[Filter Restaurants by Vegan-Friendly, Price and Distance](https://leetcode.com/problems/filter-restaurants-by-vegan-friendly-price-and-distance/)|c|[c++](./src/1333-Filter-Restaurants-by-Vegan-Friendly,-Price-and-Distance/1333.cpp)|[python](./src/1333-Filter-Restaurants-by-Vegan-Friendly,-Price-and-Distance/1333.py)|[go](./src/1333-Filter-Restaurants-by-Vegan-Friendly,-Price-and-Distance/1333.go)|[js](./src/1333-Filter-Restaurants-by-Vegan-Friendly,-Price-and-Distance/1333.js)|[java](./src/1333-Filter-Restaurants-by-Vegan-Friendly,-Price-and-Distance/1333.java)|Medium|
-|1334|[Find the City With the Smallest Number of Neighbors at a Threshold Distance](https://leetcode.com/problems/find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance/)|c|[c++](./src/1334-Find-the-City-With-the-Smallest-Number-of-Neighbors-at-a-Threshold-Distance/1334.cpp)|[python](./src/1334-Find-the-City-With-the-Smallest-Number-of-Neighbors-at-a-Threshold-Distance/1334.py)|[go](./src/1334-Find-the-City-With-the-Smallest-Number-of-Neighbors-at-a-Threshold-Distance/1334.go)|[js](./src/1334-Find-the-City-With-the-Smallest-Number-of-Neighbors-at-a-Threshold-Distance/1334.js)|[java](./src/1334-Find-the-City-With-the-Smallest-Number-of-Neighbors-at-a-Threshold-Distance/1334.java)|Medium|
+|1334|[Find the City With the Smallest Number of Neighbors at a Threshold Distance](https://leetcode.com/problems/find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance/)|c|[c++](./src/1334-Find-the-City-With-the-Smallest-Number-of-Neighbors-at-a-Threshold-Distance/1334.cpp)|[python](./src/1334-Find-the-City-With-the-Smallest-Number-of-Neighbors-at-a-Threshold-Distance/1334.py)|[go](./src/1334-Find-the-City-With-the-Smallest-Number-of-Neighbors-at-a-Threshold-Distance/1334.go)|[js](./src/1334-Find-the-City-With-the-Smallest-Number-of-Neighbors-at-a-Threshold-Distance/1334.js)|[java](./src/1334-Find-the-City-With-the-Smallest-Number-of-Neighbors-at-a-Threshold-Distance/1334.java)|Medium|
+|1335|[Minimum Difficulty of a Job Schedule](https://leetcode.com/problems/minimum-difficulty-of-a-job-schedule/)|c|[c++](./src/1335-Minimum-Difficulty-of-a-Job-Schedule/1335.cpp)|[python](./src/1335-Minimum-Difficulty-of-a-Job-Schedule/1335.py)|[go](./src/1335-Minimum-Difficulty-of-a-Job-Schedule/1335.go)|[js](./src/1335-Minimum-Difficulty-of-a-Job-Schedule/1335.js)|[java](./src/1335-Minimum-Difficulty-of-a-Job-Schedule/1335.java)|Hard|

src/1335-Minimum-Difficulty-of-a-Job-Schedule/1335.cpp

@@ -0,0 +1,26 @@
+class Solution 
+{
+public:
+    int minDifficulty(vector<int>& jobDifficulty, int d) 
+    {
+        int n = jobDifficulty.size();
+        if (n < d) return -1;
+        
+        int dp[n + 1] = {0};
+        for (int i = n - 1; i >= 0; i--) dp[i] = max(dp[i + 1], jobDifficulty[i]);
+        
+        for (int t = 1; t <= d; t++)
+        {
+            for (int i = 0; i <= n - t; i++)
+            {
+                int m = 0; dp[i] = 10010;
+                for (int j = i; j <= n - t; j++)
+                {
+                    m = max(m, jobDifficulty[j]);
+                    dp[i] = min(dp[i], m + dp[j + 1]);
+                }
+            }
+        }
+        return dp[0];
+    }
+};

src/1335-Minimum-Difficulty-of-a-Job-Schedule/1335.go

@@ -0,0 +1,37 @@
+func minDifficulty(jobDifficulty []int, d int) int {
+    n := len(jobDifficulty)
+    if n < d {
+        return -1
+    }
+    
+    dp := make([]int, n + 1)
+    for i := n - 1; i >= 0; i-- {
+        dp[i] = max(dp[i + 1], jobDifficulty[i])
+    }
+    
+    for t := 1; t <= d; t++ {
+        for i := 0; i <= n - t; i++ {
+            m := 0
+            dp[i] = 10010
+            for j := i; j <= n - t; j++ {
+                m = max(m, jobDifficulty[j])
+                dp[i] = min(dp[i], m + dp[j + 1])
+            }
+        }
+    }
+    return dp[0]
+}
+
+func max(a, b int) int {
+    if a > b {
+        return a
+    }
+    return b
+}
+
+func min(a, b int) int {
+    if a < b {
+        return a
+    }
+    return b
+}

src/1335-Minimum-Difficulty-of-a-Job-Schedule/1335.java

@@ -0,0 +1,22 @@
+class Solution {
+    public int minDifficulty(int[] jobDifficulty, int d) {
+        int n = jobDifficulty.length;
+        if (n < d) return -1;
+        
+        int[] dp = new int[n + 1];
+        for (int i = n - 1; i >= 0; i--) {
+            dp[i] = Math.max(dp[i + 1], jobDifficulty[i]);
+        }
+        
+        for (int t = 1; t <= d; t++) {
+            for (int i = 0; i <= n - t; i++) {
+                int m = 0; dp[i] = 10010;
+                for (int j = i; j <= n - t; j++) {
+                    m = Math.max(m, jobDifficulty[j]);
+                    dp[i] = Math.min(dp[i], m + dp[j + 1]);
+                }
+            }
+        }
+        return dp[0];
+    }
+}

src/1335-Minimum-Difficulty-of-a-Job-Schedule/1335.js

@@ -0,0 +1,21 @@
+var minDifficulty = function(jobDifficulty, d) {
+    let n = jobDifficulty.length;
+    if (n < d) return -1;
+
+    let dp = new Array(n + 1);
+    dp.fill(0);
+    for (let i = n - 1; i >= 0; i--) {
+        dp[i] = Math.max(dp[i + 1], jobDifficulty[i]);
+    }
+
+    for (let t = 1; t <= d; t++) {
+        for (let i = 0; i <= n - t; i++) {
+            let m = 0; dp[i] = 10010;
+            for (let j = i; j <= n - t; j++) {
+                m = Math.max(m, jobDifficulty[j]);
+                dp[i] = Math.min(dp[i], m + dp[j + 1]);
+            }
+        }
+    }
+    return dp[0];
+};

src/1335-Minimum-Difficulty-of-a-Job-Schedule/1335.py

@@ -0,0 +1,19 @@
+from functools import lru_cache
+class Solution:
+    def minDifficulty(self, jobDifficulty: List[int], d: int) -> int:
+        n = len(jobDifficulty)
+        if n < d:
+            return -1
+        
+        @lru_cache(None)
+        def dfs(u, d):
+            if d == 1:
+                return max(jobDifficulty[u:])
+            
+            res, m = float("inf"), 0
+            for i in range(u, n - d + 1):
+                m = max(m, jobDifficulty[i])
+                res = min(res, dfs(i + 1, d - 1) + m)
+            return res
+        
+        return dfs(0, d)

src/addProb.py

@@ -2,10 +2,10 @@
 import os, bisect
 
 # 题目名称
-name = "Find the City With the Smallest Number of Neighbors at a Threshold Distance"
-ID = 1334
-url = "https://leetcode.com/problems/find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance/"
-difficult = "Medium"
+name = "Minimum Difficulty of a Job Schedule"
+ID = 1335
+url = "https://leetcode.com/problems/minimum-difficulty-of-a-job-schedule/"
+difficult = "Hard"
 prog = ['c', 'cpp', 'py', 'go', 'js', 'java']