feat: leetcode contest 271

Author: upupming

leetcode/contest-271/5952. Rings and Rods.js

@@ -0,0 +1,18 @@
+/**
+ * @param {string} rings
+ * @return {number}
+ */
+const countPoints = function (ri) {
+  const r = ri.split('')
+  const cnt = []
+  for (let i = 0; i < r.length; i += 2) {
+    const c = r[i]; const l = Number(r[i + 1])
+    if (!cnt[l]) cnt[l] = new Set()
+    cnt[l].add(c)
+  }
+  let ans = 0
+  for (const s of cnt) {
+    if (s?.size >= 3) ans++
+  }
+  return ans
+}

leetcode/contest-271/5953. Sum of Subarray Ranges.js

@@ -0,0 +1,22 @@
+/**
+ * @param {number[]} nums
+ * @return {number}
+ */
+const subArrayRanges = function (nums) {
+  const n = nums.length
+  let ans = 0n
+  for (let i = 0; i < n; i++) {
+    // 作为最大值的次数
+    let j = i - 1; let k = i + 1
+    while (j >= 0 && nums[j] <= nums[i]) j--
+    while (k < n && nums[k] < nums[i]) k++
+    const cnt1 = k - j - 1 + (i - j - 1) * (k - i - 1)
+    let x = i - 1; let y = i + 1
+    while (x >= 0 && nums[x] > nums[i]) x--
+    while (y < n && nums[y] >= nums[i]) y++
+    const cnt2 = y - x - 1 + (i - x - 1) * (y - i - 1)
+    // console.log(i, nums[i], cnt1, cnt2)
+    ans += BigInt((cnt1 - cnt2) * nums[i])
+  }
+  return Number(ans)
+}

leetcode/contest-271/5954. Watering Plants II.js

@@ -0,0 +1,27 @@
+/**
+ * @param {number[]} plants
+ * @param {number} capacityA
+ * @param {number} capacityB
+ * @return {number}
+ */
+const minimumRefill = function (p, a, b) {
+  const n = p.length
+  let ca = a; let cb = b
+  let ans = 0
+  for (let i = 0, j = n - 1; i <= j; i++, j--) {
+    if (i === j) {
+      // console.log(ca, cb, p[i])
+      if (ca >= cb && ca >= p[i]) ca -= p[i]
+      else if (ca < cb && cb >= p[i]) cb -= p[i]
+      else ans++
+    } else {
+      // A
+      if (p[i] > ca) ca = a, ans++
+      ca -= p[i]
+      // B
+      if (p[j] > cb) cb = b, ans++
+      cb -= p[j]
+    }
+  }
+  return ans
+}

leetcode/contest-271/5955. Maximum Fruits Harvested After at Most K Steps.js

@@ -0,0 +1,38 @@
+/**
+ * @param {number[][]} fruits
+ * @param {number} startPos
+ * @param {number} k
+ * @return {number}
+ */
+const maxTotalFruits = function (f, s, k) {
+  const sum = []
+  sum[-1] = 0
+  const n = f.length
+  for (let i = 0, j = 0; j < n; i++) {
+    if (f[j][0] === i) {
+      sum[i] = sum[i - 1] + f[j][1]
+      j++
+    } else {
+      sum[i] = sum[i - 1]
+    }
+  }
+  while (sum.length - 1 < s) sum.push(sum[sum.length - 1])
+  const m = sum.length - 1
+  let ans = 0
+  for (let x = Math.max(0, s - k); x <= s; x++) {
+    let l = s; let r = m
+    const valid = (y) => {
+      const dx = s - x; const dy = y - s
+      if (2 * dx + dy <= k || dx + 2 * dy <= k) return true
+      return false
+    }
+    while (l < r) {
+      const mid = l + r + 1 >> 1
+      if (valid(mid)) l = mid
+      else r = mid - 1
+    }
+    // console.log(x, l)
+    ans = Math.max(ans, sum[l] - sum[x - 1])
+  }
+  return ans
+}

leetcode/残酷刷题/221. Maximal Square.js

@@ -0,0 +1,27 @@
+/**
+ * @param {character[][]} matrix
+ * @return {number}
+ */
+const maximalSquare = function (ma) {
+  const m = ma.length; const n = ma[0].length
+  const sum = [...Array(m + 1)].map(() => Array(n + 1).fill(0))
+  for (let i = 1; i <= m; i++) {
+    for (let j = 1; j <= n; j++) {
+      sum[i][j] = sum[i - 1][j] + sum[i][j - 1] - sum[i - 1][j - 1] + Number(ma[i - 1][j - 1])
+    }
+  }
+  let ans = 0
+  for (let i0 = 1; i0 <= m; i0++) {
+    for (let j0 = 1; j0 <= n; j0++) {
+      for (let i1 = i0; i1 <= m; i1++) {
+        const j1 = j0 + i1 - i0
+        const area = sum[i1][j1] - sum[i1][j0 - 1] - sum[i0 - 1][j1] + sum[i0 - 1][j0 - 1]
+        if (area === (i1 - i0 + 1) * (j1 - j0 + 1)) {
+          // console.log(i0, j0, i1, j1, area)
+          ans = Math.max(ans, area)
+        }
+      }
+    }
+  }
+  return ans
+}

leetcode/残酷刷题/866. Prime Palindrome.ts

@@ -1,26 +1,37 @@
-function primePalindrome (n: number): number {
-  const z: number[] = []
-  for (let x = 1; x <= 2e4; x++) {
-    const y: Array<number|string> = [
-      String(x) + String(x).split('').reverse().join('')
-    ]
-    for (let i = 0; i < 10; i++) {
-      y.push(String(x) + String(i) + String(x).split('').reverse().join(''))
+const s = []
+const getS = () => {
+  if (s.length) return
+  const isPrime = (a) => {
+    if (a === 1) return false
+    for (let i = 2; i <= a / i; i++) {
+      if (a % i === 0) return false
     }
-    if (x < 10) y.push(x)
-    z.push(...y.map(Number))
+    return true
   }
+  for (let i = 1; i < 1e4; i++) {
+    if (i < 10 && isPrime(i)) s.push(i)
+Bg
+    // 偶数长
+    const a = Number(String(i) + String(i).split('').reverse().join(''))
+    if (isPrime(a)) s.push(a)
 
-  z.sort((a, b) => a - b)
-  for (const val of z) {
-    if (isPrime(val) && val >= n) return val
-  }
-  return -1
-  function isPrime (n: number): boolean {
-    if (n === 1) return false
-    for (let i = 2; i <= Math.sqrt(n); i++) {
-      if (n % i === 0) return false
+    // 奇数长
+    for (let j = 0; j < 10; j++) {
+      const a = Number(String(i) + String(j) + String(i).split('').reverse().join(''))
+      if (isPrime(a)) s.push(a)
     }
-    return true
   }
+  s.sort((a, b) => a - b)
+}
+
+function primePalindrome (n: number): number {
+  getS()
+  let l = 0; let r = s.length - 1
+  // console.log(s[r])
+  while (l < r) {
+    const mid = l + r >> 1
+    if (s[mid] >= n) r = mid
+    else l = mid + 1
+  }
+  return s[l]
 };