feat: problems of next week

Author: upupming

leetcode/残酷刷题/1723. Find Minimum Time to Finish All Jobs.js

@@ -0,0 +1,33 @@
+/**
+ * @param {number[]} jobs
+ * @param {number} k
+ * @return {number}
+ */
+const minimumTimeRequired = function (jobs, k) {
+  const n = jobs.length
+  const cache = {}
+  const time = (i) => {
+    if (cache[i] != null) return cache[i]
+    let ans = 0
+    for (let k = 0; k < n; k++) {
+      if (i >> k & 1) ans += jobs[k]
+    }
+    return cache[i] = ans
+  }
+  const dp = Array(k + 1).fill(0).map(() => Array(1 << n).fill(1e10))
+  dp[0][0] = 0
+  for (let i = 1; i <= k; i++) {
+    dp[i][0] = 0
+    for (let j = 1; j < 1 << n; j++) {
+      // j 的所有子集
+      for (let k = j; ; k = (k - 1) & j) {
+        dp[i][j] = Math.min(
+          dp[i][j],
+          Math.max(dp[i - 1][j - k], time(k))
+        )
+        if (k === 0) break
+      }
+    }
+  }
+  return dp[k][(1 << n) - 1]
+}

leetcode/残酷刷题/329. Longest Increasing Path in a Matrix.js

@@ -0,0 +1,31 @@
+/**
+ * @param {number[][]} matrix
+ * @return {number}
+ */
+const longestIncreasingPath = function (matrix) {
+  const m = matrix.length; const n = matrix[0].length
+  const dx = [0, 0, 1, -1]
+  const dy = [1, -1, 0, 0]
+  const valid = (i, j) => i >= 0 && i < m && j >= 0 && j < n
+  const cache = {}
+  const get = (i, j) => {
+    const key = `${i}_${j}`
+    if (cache[key] != null) return cache[key]
+    let ans = 1
+    for (let k = 0; k < 4; k++) {
+      const x = i + dx[k]
+      const y = j + dy[k]
+      if (valid(x, y) && matrix[i][j] > matrix[x][y]) {
+        ans = Math.max(ans, get(x, y) + 1)
+      }
+    }
+    return cache[key] = ans
+  }
+  let ans = 0
+  for (let i = 0; i < m; i++) {
+    for (let j = 0; j < n; j++) {
+      ans = Math.max(ans, get(i, j))
+    }
+  }
+  return ans
+}