feat: leetcode contest 290

Author: upupming

leetcode/contest-290/6041. Intersection of Multiple Arrays.js

@@ -0,0 +1,15 @@
+/**
+ * @param {number[][]} nums
+ * @return {number[]}
+ */
+ var intersection = function(nums) {
+  const cnt = {}
+  for (const p of nums) {
+      for (const a of p) cnt[a] = (cnt[a]||0)+1
+  }
+  let ans = []
+  for (const [k, v] of Object.entries(cnt)) {
+      if (v === nums.length) ans.push(Number(k))
+  }
+  return ans.sort((a, b) => a - b)
+};

leetcode/contest-290/6042. Count Lattice Points Inside a Circle.js

@@ -0,0 +1,21 @@
+/**
+ * @param {number[][]} circles
+ * @return {number}
+ */
+const countLatticePoints = function (circles) {
+  let ans = 0
+  for (let i = 0; i <= 200; i++) {
+    for (let j = 0; j <= 200; j++) {
+      let ok = false
+      for (const [x, y, r] of circles) {
+        const d = (x - i) * (x - i) + (y - j) * (y - j)
+        if (d <= r * r) {
+          ok = true
+          break
+        }
+      }
+      ans += ok
+    }
+  }
+  return ans
+}

leetcode/contest-290/6043. Count Number of Rectangles Containing Each Point.js

@@ -0,0 +1,30 @@
+/**
+ * @param {number[][]} rectangles
+ * @param {number[][]} points
+ * @return {number[]}
+ */
+const countRectangles = function (rectangles, points) {
+  const bh = Array(101).fill(0).map(() => [])
+  for (const r of rectangles) {
+    const [l, h] = r
+    bh[h].push(l)
+  }
+  bh.forEach(h => h.sort((a, b) => a - b))
+  // console.log(bh)
+  const ans = []
+  for (const [l, h] of points) {
+    let cnt = 0
+    for (let i = h; i <= 100; i++) {
+      let lft = 0; let rgt = bh[i].length
+      while (lft < rgt) {
+        const mid = lft + rgt >> 1
+        if ((mid === bh[i].length) || bh[i][mid] >= l) rgt = mid
+        else lft = mid + 1
+      }
+      cnt += bh[i].length - lft
+      // console.log(l, h, i, bh[i], lft)
+    }
+    ans.push(cnt)
+  }
+  return ans
+}

leetcode/contest-290/6044. Number of Flowers in Full Bloom.js

@@ -0,0 +1,46 @@
+/**
+ * @param {number[][]} flowers
+ * @param {number[]} persons
+ * @return {number[]}
+ */
+const fullBloomFlowers = function (flowers, persons) {
+  // 离散化，注意右端点的值是 e+1
+  const p = []
+  for (const [s, e] of flowers) p.push(s, e + 1)
+  p.sort((a, b) => a - b)
+  const mp = {}
+  for (let i = 0; i < p.length; i++) mp[p[i]] = i
+
+  // 计算差分数组
+  const diff = Array(p.length).fill(0)
+  for (const [s, e] of flowers) {
+    const si = mp[s]; const ei = mp[e + 1]
+    diff[si] += 1
+    diff[ei] -= 1
+  }
+
+  // 利用差分数组计算原始数组，表示每个时间点的花的数量
+  const a = []; let prev = 0
+  const pi = persons.map((p, i) => [p, i]).sort((a, b) => a[0] - b[0])
+  let j = 0; const ans = []
+  for (let i = 0; i < diff.length; i++) {
+    while (j < pi.length && pi[j][0] < p[i]) {
+      ans[pi[j][1]] = prev, j++
+    }
+    a[i] = prev + diff[i]
+    prev = a[i]
+  }
+  while (j < pi.length) ans[pi[j][1]] = prev, j++
+  return ans
+}
+/*
+[[19,37],[19,38],[19,35]]
+[6,7,21,1,13,37,5,37,46,43]
+
+[0,0,3,0,0,2,0,2,0,0]
+
+[[11,11],[24,46],[3,25],[44,46]]
+[1,8,26,7,43,26,1]
+
+[0,1,1,1,1,1,0]
+*/