feat: leetcode contest 294

Author: upupming

leetcode/contest-294/6074. Percentage of Letter in String.js

@@ -0,0 +1,13 @@
+/**
+ * @param {string} s
+ * @param {character} letter
+ * @return {number}
+ */
+ var percentageLetter = function(s, letter) {
+  const n = s.length
+  let cnt = 0
+  for (const ch of s) {
+      if (ch === letter) cnt++
+  }
+  return Math.floor(cnt / n * 100)
+};

leetcode/contest-294/6075. Maximum Bags With Full Capacity of Rocks.js

@@ -0,0 +1,21 @@
+/**
+ * @param {number[]} capacity
+ * @param {number[]} rocks
+ * @param {number} additionalRocks
+ * @return {number}
+ */
+const maximumBags = function (c, r, a) {
+  const x = []
+  const n = c.length
+  for (let i = 0; i < n; i++) {
+    x.push(c[i] - r[i])
+  }
+  x.sort((a, b) => a - b)
+  let cnt = 0
+  for (const y of x) {
+    if (a < y) break
+    a -= y
+    cnt++
+  }
+  return cnt
+}

leetcode/contest-294/6076. Minimum Lines to Represent a Line Chart.js

@@ -0,0 +1,23 @@
+/**
+ * @param {number[][]} stockPrices
+ * @return {number}
+ */
+const minimumLines = function (s) {
+  const n = s.length
+  s.sort((a, b) => a[0] - b[0])
+  let ans = 0
+  for (let i = 0; i < n;) {
+    if (i === n - 1) {
+      break
+    } else {
+      const p = [s[i + 1][0] - s[i][0], s[i + 1][1] - s[i][1]]; let j = i + 2
+      while (j < n && (BigInt(p[0]) * BigInt(s[j][1] - s[i][1])) === (BigInt(p[1]) * BigInt(s[j][0] - s[i][0]))) {
+        j++
+      }
+      ans++
+      // console.log(i, p, j-1)
+      i = j - 1
+    }
+  }
+  return ans
+}

leetcode/contest-294/6077. Sum of Total Strength of Wizards.js

@@ -0,0 +1,31 @@
+/**
+ * @param {number[]} strength
+ * @return {number}
+ */
+const totalStrength = function (s) {
+  const n = s.length
+  s.unshift(-1), s.push(-1)
+  const sum = [0]; const ss = [0]; const P = 1e9 + 7; const Pn = BigInt(1e9 + 7)
+  for (let i = 1; i <= n; i++) sum[i] = (sum[i - 1] + s[i]) % P
+  for (let i = 1; i <= n; i++) ss[i] = (ss[i - 1] + sum[i]) % P
+  const L = []; const R = []; let stk = [0]
+  for (let i = 1; i <= n; i++) {
+    while (s[stk[stk.length - 1]] >= s[i]) stk.pop()
+    L[i] = stk[stk.length - 1] + 1
+    stk.push(i)
+  }
+  stk = [n + 1]
+  for (let i = n; i >= 1; i--) {
+    while (s[stk[stk.length - 1]] > s[i]) stk.pop()
+    R[i] = stk[stk.length - 1] - 1
+    stk.push(i)
+  }
+  let ans = 0n
+
+  for (let i = 1; i <= n; i++) {
+    const tmp = BigInt(i - L[i] + 1) * BigInt((ss[R[i]] - ss[i - 1] + P) % P) % Pn - BigInt(R[i] - i + 1) * BigInt((ss[i - 1] - (ss[L[i] - 2] ?? 0) + P) % P) % Pn + Pn
+    ans = (ans + tmp * BigInt(s[i])) % Pn
+  }
+
+  return ans
+}