feat: leetcode contest 291

Author: upupming

leetcode/contest-291/6047. Remove Digit From Number to Maximize Result.js

@@ -0,0 +1,18 @@
+/**
+ * @param {string} number
+ * @param {character} digit
+ * @return {string}
+ */
+const removeDigit = function (number, digit) {
+  const n = number.length
+  const p = []
+  for (let i = 0; i < n; i++) {
+    if (number[i] === digit) {
+      let tmp = number.slice(0, i) + number.slice(i + 1)
+      while (tmp[0] === '0') tmp = tmp.slice(1)
+      p.push(tmp)
+    }
+  }
+  p.sort()
+  return p[p.length - 1]
+}

leetcode/contest-291/6048. Minimum Consecutive Cards to Pick Up.js

@@ -0,0 +1,14 @@
+/**
+ * @param {number[]} cards
+ * @return {number}
+ */
+const minimumCardPickup = function (cards) {
+  const h = {}; let ans = 1e10
+  for (let i = 0; i < cards.length; i++) {
+    const c = cards[i]
+    // console.log(i, c, h)
+    if (h[c] != null) ans = Math.min(ans, i - h[c] + 1)
+    h[c] = i
+  }
+  return ans === 1e10 ? -1 : ans
+}

leetcode/contest-291/6049. K Divisible Elements Subarrays-hash.js

@@ -0,0 +1,33 @@
+/**
+ * @param {number[]} nums
+ * @param {number} k
+ * @param {number} p
+ * @return {number}
+ */
+const countDistinct = function (nums, k, p) {
+  const n = nums.length
+  const s = new Set(); const P = 13331; const Q = 1e4 + 7; const Q1 = 1e5 + 7; const Q2 = 1e6 + 7
+  const f = [0]; const g = [1]; const cnt = [0]
+  const f1 = [0]; const g1 = [1]
+  const f2 = [0]; const g2 = [1]
+  for (let i = 1; i <= n; i++) {
+    f[i] = (f[i - 1] * P + nums[i - 1]) % Q
+    g[i] = (g[i - 1] * P) % Q
+    f1[i] = (f1[i - 1] * P + nums[i - 1]) % Q1
+    g1[i] = (g1[i - 1] * P) % Q1
+    f2[i] = (f2[i - 1] * P + nums[i - 1]) % Q2
+    g2[i] = (g2[i - 1] * P) % Q2
+    cnt[i] = cnt[i - 1] + (nums[i - 1] % p === 0 ? 1 : 0)
+  }
+  for (let i = 1; i <= n; i++) {
+    for (let j = i; j <= n; j++) {
+      const h = ((f[j] - (f[i - 1] * g[j - i + 1])) % Q + Q) % Q
+      const h1 = ((f1[j] - (f1[i - 1] * g1[j - i + 1])) % Q1 + Q1) % Q1
+      const h2 = ((f2[j] - (f2[i - 1] * g2[j - i + 1])) % Q2 + Q2) % Q2
+      const c = cnt[j] - cnt[i - 1]
+      if (c <= k) s.add(`${h}_${h1}_${h2}`)
+    }
+  }
+  // console.log(s)
+  return s.size
+}

leetcode/contest-291/6049. K Divisible Elements Subarrays.js

@@ -0,0 +1,22 @@
+/**
+ * @param {number[]} nums
+ * @param {number} k
+ * @param {number} p
+ * @return {number}
+ */
+const countDistinct = function (nums, k, p) {
+  const n = nums.length
+  const s = new Set()
+  for (let i = 0; i < n; i++) {
+    for (let j = i; j < n; j++) {
+      let tmp = ''; let cnt = 0
+      for (let k = i; k <= j; k++) {
+        tmp += `_${nums[k]}`
+        cnt += nums[k] % p === 0
+      }
+      if (cnt <= k) { s.add(tmp) }
+    }
+  }
+  // console.log(s)
+  return s.size
+}

leetcode/contest-291/6050. Total Appeal of A String.js

@@ -0,0 +1,16 @@
+/**
+ * @param {string} s
+ * @return {number}
+ */
+const appealSum = function (s) {
+  const n = s.length
+  const h = {}; let cnt = 0
+  for (let i = 0; i < n; i++) {
+    let x = i + 1; const y = n - i
+    if (h[s[i]] != null) x = i - h[s[i]]
+    cnt += x * y
+    // console.log(i, s[i], cnt)
+    h[s[i]] = i
+  }
+  return cnt
+}