feat: leetcode contest 308

Author: upupming

leetcode/contest-308/6160. Longest Subsequence With Limited Sum.js

@@ -0,0 +1,17 @@
+/**
+ * @param {number[]} nums
+ * @param {number[]} queries
+ * @return {number[]}
+ */
+const answerQueries = function (nums, queries) {
+  const n = nums.length; const m = queries.length
+  const sum = [0]
+  nums.sort((a, b) => a - b)
+  for (let i = 1; i <= n; i++) sum[i] = sum[i - 1] + nums[i - 1]
+  return queries.map(q => {
+    for (let i = 0; i <= n; i++) {
+      if (sum[i] > q) return i - 1
+    }
+    return n
+  })
+}

leetcode/contest-308/6161. Removing Stars From a String.js

@@ -0,0 +1,12 @@
+/**
+ * @param {string} s
+ * @return {string}
+ */
+const removeStars = function (s) {
+  const t = []
+  for (const ch of s) {
+    if (ch === '*' && t.length) t.pop()
+    else t.push(ch)
+  }
+  return t.join('')
+}

leetcode/contest-308/6162. Minimum Amount of Time to Collect Garbage.js

@@ -0,0 +1,37 @@
+/**
+ * @param {string[]} garbage
+ * @param {number[]} travel
+ * @return {number}
+ */
+const garbageCollection = function (g, t) {
+  const s = 'PGM'
+  const idx = Array(3).fill(0)
+  const n = g.length
+  for (let k = 0; k < 3; k++) {
+    const ch = s[k]
+    for (let i = 0; i < n; i++) {
+      if (g[i].includes(ch)) idx[k] = i + 1
+    }
+  }
+  let ans = 0; const sum = [0]; const s1 = []
+  for (let i = 1; i < n; i++) {
+    sum[i] = sum[i - 1] + t[i - 1]
+  }
+  const cnt = (s, ch) => {
+    let ans = 0
+    for (const c of s) ans += ch === c
+    return ans
+  }
+  for (let k = 0; k < 3; k++) {
+    s1[k] = [0]
+    for (let i = 1; i <= n; i++) {
+      s1[k][i] = s1[k][i - 1] + cnt(g[i - 1], s[k])
+    }
+  }
+  for (let k = 0; k < 3; k++) {
+    if (idx[k] > 0) {
+      ans += s1[k][idx[k]] + sum[idx[k] - 1]
+    }
+  }
+  return ans
+}

leetcode/contest-308/6163. Build a Matrix With Conditions.js

@@ -0,0 +1,49 @@
+/**
+ * @param {number} k
+ * @param {number[][]} rowConditions
+ * @param {number[][]} colConditions
+ * @return {number[][]}
+ */
+const buildMatrix = function (k, rc, cc) {
+  const n = rc.length; const m = cc.length
+
+  const get = (rc) => {
+    const e = Array(k + 1).fill(0).map(() => [])
+    const deg = Array(k + 1).fill(0)
+    for (const [a, b] of rc) {
+      e[a].push(b)
+      deg[b]++
+    }
+    const q = []
+    for (let i = 1; i <= k; i++) {
+      if (deg[i] === 0) q.push(i)
+    }
+    const r = []
+    while (q.length) {
+      const x = q.shift()
+      r.push(x)
+      for (const y of e[x]) {
+        if (--deg[y] === 0) {
+          q.push(y)
+        }
+      }
+    }
+    return r.length === k ? r : false
+  }
+
+  const r = get(rc)
+  if (!r) return []
+
+  const c = get(cc)
+  if (!c) return []
+
+  const ans = Array(k).fill(0).map(() => Array(k).fill(0))
+  for (let i = 0; i < k; i++) {
+    for (let j = 0; j < k; j++) {
+      if (r[i] === c[j]) {
+        ans[i][j] = r[i]
+      }
+    }
+  }
+  return ans
+}