feat: leetcode contest 298

Author: upupming

leetcode/contest-298/5218. Sum of Numbers With Units Digit K.js

@@ -0,0 +1,22 @@
+/**
+ * @param {number} num
+ * @param {number} k
+ * @return {number}
+ */
+const map = {}
+var minimumNumbers = function (num, k) {
+  if (map[`${num}_${k}`] != null) return map[`${num}_${k}`]
+  // console.log(num, k)
+  if (num === 0) return 0
+  if (num < k) return -1
+  let ans = 1e10
+  // 枚举最后一个数
+  for (let i = 1; i <= num; i++) {
+    if (i % 10 === k) {
+      const prev = minimumNumbers(num - i, k)
+      if (prev === -1) continue
+      else ans = Math.min(ans, prev + 1)
+    }
+  }
+  return map[`${num}_${k}`] = (ans === 1e10 ? -1 : ans)
+}

leetcode/contest-298/5242. Greatest English Letter in Upper and Lower Case.js

@@ -0,0 +1,20 @@
+/**
+ * @param {string} s
+ * @return {string}
+ */
+ var greatestLetter = function(s) {
+  const st = new Set()
+  for (let i = 0; i < 26; i++) {
+      const x = String.fromCharCode('a'.charCodeAt(0)+i)
+      const X = String.fromCharCode('A'.charCodeAt(0)+i)
+      if (s.includes(x) && s.includes(X)) st.add(i)
+  }
+  let ans = '', max = -1
+  for (const i of st) {
+      if (i > max) {
+          max = i
+          ans = String.fromCharCode('A'.charCodeAt(0)+i)
+      }
+  }
+  return ans
+};

leetcode/contest-298/5254. Selling Pieces of Wood.js

@@ -0,0 +1,19 @@
+/**
+ * @param {number} m
+ * @param {number} n
+ * @param {number[][]} prices
+ * @return {number}
+ */
+const sellingWood = function (m, n, ps) {
+  const f = Array(m + 1).fill(0).map(() => Array(n + 1).fill(0))
+  for (const [h, w, p] of ps) {
+    f[h][w] = p
+  }
+  for (let i = 1; i <= m; i++) {
+    for (let j = 1; j <= n; j++) {
+      for (let k = 1; k <= i; k++) f[i][j] = Math.max(f[i][j], f[k][j] + f[i - k][j])
+      for (let k = 1; k <= j; k++) f[i][j] = Math.max(f[i][j], f[i][k] + f[i][j - k])
+    }
+  }
+  return f[m][n]
+}

leetcode/contest-298/6099. Longest Binary Subsequence Less Than or Equal to K.js

@@ -0,0 +1,32 @@
+/**
+ * @param {string} s
+ * @param {number} k
+ * @return {number}
+
+dp[i][j] 以 i 结尾长度为 j 的最小值
+dp[i][j] <= k, ans = max(ans, j)
+dp[0...i-1][j-1]
+ */
+const longestSubsequence = function (s, k) {
+  const n = s.length; const dp = Array(n + 1).fill(0).map(() => Array(n + 1).fill(1e10))
+  s = ' ' + s
+  let ans = 0
+  let min = Array(n + 1).fill(1e10)
+  min[0] = 0
+  for (let i = 1; i <= n; i++) {
+    // 长度为 0 的值都为 0
+    dp[i][0] = 0
+    const next_min = [...min]
+    for (let j = 1; j <= i; j++) {
+      // for (let l = 0; l < i; l++) {
+      //     dp[i][j] = Math.min(dp[i][j], dp[l][j-1]*2 + Number(s[i]))
+      // }
+      // console.log(i, j, dp[i][j])
+      dp[i][j] = Math.min(dp[i][j], min[j - 1] * 2 + Number(s[i]))
+      if (dp[i][j] <= k) ans = Math.max(ans, j)
+      next_min[j] = Math.min(next_min[j], dp[i][j])
+    }
+    min = next_min
+  }
+  return ans
+}