feat: leetcode contest 302

Author: upupming

leetcode/contest-302/6120. Maximum Number of Pairs in Array.js

@@ -0,0 +1,17 @@
+/**
+ * @param {number[]} nums
+ * @return {number[]}
+ */
+const numberOfPairs = function (nums) {
+  const cnt = {}
+  for (const a of nums) {
+    cnt[a] ??= 0
+    cnt[a]++
+  }
+  let p = 0; let l = 0
+  for (const [k, v] of Object.entries(cnt)) {
+    p += Math.floor(v / 2)
+    l += v % 2
+  }
+  return [p, l]
+}

leetcode/contest-302/6121. Query Kth Smallest Trimmed Number.js

@@ -0,0 +1,21 @@
+/**
+ * @param {string[]} nums
+ * @param {number[][]} queries
+ * @return {number[]}
+ */
+const smallestTrimmedNumbers = function (nums, qs) {
+  const n = nums.length; const m = qs.length
+  const l = nums[0].length
+  const idx = Array(n).fill(0).map((_, idx) => idx)
+  const ans = []
+  for (const [k, trim] of qs) {
+    idx.sort((i, j) => {
+      const s = nums[i].slice(l - trim, l)
+      const t = nums[j].slice(l - trim, l)
+      if (s === t) return i - j
+      return s < t ? -1 : 1
+    })
+    ans.push(idx[k - 1])
+  }
+  return ans
+}

leetcode/contest-302/6122. Minimum Deletions to Make Array Divisible.js

@@ -0,0 +1,23 @@
+/**
+ * @param {number[]} nums
+ * @param {number[]} numsDivide
+ * @return {number}
+ */
+const minOperations = function (nums, nd) {
+  nums.sort((a, b) => a - b)
+  const n = nums.length
+
+  const gcd = (a, b) => b ? gcd(b, a % b) : a
+  let d = nd[0]
+  for (let i = 1; i < nd.length; i++) d = gcd(d, nd[i])
+
+  let mi
+  for (let i = 0; i < n; i++) {
+    if (d % nums[i] === 0) {
+      mi = i
+      break
+    }
+  }
+  if (mi == null) return -1
+  return mi
+}

leetcode/contest-302/6164. Max Sum of a Pair With Equal Sum of Digits.js

@@ -0,0 +1,23 @@
+/**
+ * @param {number[]} nums
+ * @return {number}
+ */
+const maximumSum = function (nums) {
+  const map = {}
+  for (const x of nums) {
+    let s = 0; let y = x
+    while (y) {
+      s += y % 10
+      y = Math.floor(y / 10)
+    }
+    map[s] ??= []
+    map[s].push(x)
+  }
+  let ans = -1
+  for (const [k, v] of Object.entries(map)) {
+    if (v.length < 2) continue
+    v.sort((a, b) => (b - a))
+    ans = Math.max(ans, v[0] + v[1])
+  }
+  return ans
+}

leetcode/残酷刷题/README.md

@@ -11,7 +11,7 @@
         - [DP](#dp)
             - [二分图](#二分图)
             - [状态压缩](#状态压缩)
-            - [LIS](#lis)
+            - [LIS (最长上升子序列)](#lis-最长上升子序列)
             - [背包](#背包)
             - [subsequence 计数](#subsequence-计数)
             - [二分查找](#二分查找)
@@ -123,7 +123,7 @@
 - 1284. Minimum Number of Flips to Convert Binary Matrix to Zero Matrix
 - 1452. People Whose List of Favorite Companies Is Not a Subset of Another List
 
-#### LIS
+#### LIS (最长上升子序列)
 
 - 300. Longest Increasing Subsequence
 - 1964. Find the Longest Valid Obstacle Course at Each Position