feat: leetcode contest 293

Author: upupming

leetcode/contest-293/5234. Find Resultant Array After Removing Anagrams.js

@@ -0,0 +1,17 @@
+/**
+ * @param {string[]} words
+ * @return {string[]}
+ */
+const removeAnagrams = function (words) {
+  const ans = []
+  let last
+  for (let i = 0; i < words.length; i++) {
+    cur = words[i].split('').sort().join('')
+    if (cur === last) continue
+    else {
+      ans.push(words[i])
+      last = cur
+    }
+  }
+  return ans
+}

leetcode/contest-293/6064. Maximum Consecutive Floors Without Special Floors.js

@@ -0,0 +1,26 @@
+/**
+ * @param {number} bottom
+ * @param {number} top
+ * @param {number[]} special
+ * @return {number}
+ */
+const maxConsecutive = function (b, t, s) {
+  s.sort((a, b) => a - b)
+  s.push(1e10)
+  const n = s.length
+  let ans = 0
+  for (let i = 0; i < n; i++) {
+    if (s[i] <= b) continue
+    if (s[i] > t) {
+      ans = Math.max(ans, t - Math.max(s[i - 1] + 1, b) + 1)
+      break
+    }
+
+    let last = b
+    if (i > 0) last = Math.max(s[i - 1] + 1, b)
+    const len = s[i] - last
+    ans = Math.max(ans, len)
+    // console.log(i, last, s[i], len, ans)
+  }
+  return ans
+}

leetcode/contest-293/6065. Largest Combination With Bitwise AND Greater Than Zero.js

@@ -0,0 +1,15 @@
+/**
+ * @param {number[]} candidates
+ * @return {number}
+ */
+const largestCombination = function (cs) {
+  let ans = 0
+  for (let i = 31; i >= 0; i--) {
+    let cnt = 0
+    for (const s of cs) {
+      if (s >> i & 1) cnt++
+    }
+    ans = Math.max(ans, cnt)
+  }
+  return ans
+}

leetcode/contest-293/6066. Count Integers in Intervals-1.cpp

@@ -0,0 +1,30 @@
+class CountIntervals {
+    CountIntervals *left = nullptr, *right = nullptr;
+    int l, r, sum = 0;
+
+   public:
+    CountIntervals() : l(1), r(1e9) {}
+
+    CountIntervals(int l, int r) : l(l), r(r) {}
+
+    void add(int L, int R) {           // 为方便区分变量名，将递归中始终不变的入参改为大写（视作常量）
+        if (sum == r - l + 1) return;  // 当前节点已被完整覆盖，无需执行任何操作
+        if (L <= l && r <= R) {        // 当前节点已被区间 [L,R] 完整覆盖，不再继续递归
+            sum = r - l + 1;
+            return;
+        }
+        int mid = (l + r) / 2;
+        if (left == nullptr) left = new CountIntervals(l, mid);        // 动态开点
+        if (right == nullptr) right = new CountIntervals(mid + 1, r);  // 动态开点
+        if (L <= mid) left->add(L, R);
+        if (mid < R) right->add(L, R);
+        sum = left->sum + right->sum;
+    }
+
+    int count() { return sum; }
+};
+
+// 作者：endlesscheng
+// 链接：https://leetcode.cn/problems/count-integers-in-intervals/solution/by-endlesscheng-clk2/
+// 来源：力扣（LeetCode）
+// 著作权归作者所有。商业转载请联系作者获得授权，非商业转载请注明出处。

leetcode/contest-293/6066. Count Integers in Intervals.cpp

@@ -0,0 +1,38 @@
+#include <bits/stdc++.h>
+using namespace std;
+
+class CountIntervals {
+    typedef pair<int, int> pii;
+    int ans = 0;
+    set<pii> st;
+
+   public:
+    CountIntervals() {
+    }
+
+    void add(int left, int right) {
+        // st 中已有的区间总是保持互不相交的
+        auto it = st.lower_bound({left - 1, -1});
+        while (it != st.end()) {
+            // 不可能合并了
+            if (it->second >= right + 1) break;
+            right = max(right, it->first);
+            left = min(left, it->second);
+            ans -= it->first - it->second + 1;
+            st.erase(it++);
+        }
+        ans += right - left + 1;
+        st.insert({right, left});
+    }
+
+    int count() {
+        return ans;
+    }
+};
+
+/**
+ * Your CountIntervals object will be instantiated and called as such:
+ * CountIntervals* obj = new CountIntervals();
+ * obj->add(left,right);
+ * int param_2 = obj->count();
+ */

leetcode/contest-293/6066. Count Integers in Intervals.js

@@ -0,0 +1,95 @@
+function Node (start, end) {
+  this.val = 0
+  this.start = start
+  this.end = end
+  this.left = null
+  this.right = null
+}
+
+function SegmentTree (start, end) {
+  this.root = new Node(start, end)
+}
+
+SegmentTree.prototype.update = function (start, end) {
+  this.updateNode(this.root, start, end)
+}
+
+SegmentTree.prototype.updateNode = function (node, start, end) {
+  if (!node) {
+    return
+  }
+  if (start > node.end || end < node.start) {
+
+  } else if (start <= node.start && end >= node.end) {
+    node.val = node.end - node.start + 1
+  } else {
+    this.pushdown(node)
+    this.updateNode(node.left, start, end)
+    this.updateNode(node.right, start, end)
+    this.pushup(node)
+  }
+}
+
+SegmentTree.prototype.pushdown = function (node) {
+  if (!node) {
+    return
+  }
+  const mid = Math.floor((node.start + node.end) / 2)
+  if (!node.left) {
+    node.left = new Node(node.start, mid)
+  }
+  if (!node.right) {
+    node.right = new Node(mid + 1, node.end)
+  }
+  if (node.val === (node.end - node.start + 1)) {
+    node.left.val = mid - node.start + 1
+    node.right.val = node.end - mid
+  }
+}
+
+SegmentTree.prototype.pushup = function (node) {
+  node.val = node.left.val + node.right.val
+}
+
+SegmentTree.prototype.query = function (start, end) {
+  return this.queryNode(this.root, start, end)
+}
+
+SegmentTree.prototype.queryNode = function (node, start, end) {
+  if (!node) {
+    return 0
+  }
+  if (start > node.end || end < node.start) {
+    return 0
+  } else if (start <= node.start && end >= node.end) {
+    return node.val
+  } else {
+    this.pushdown(node)
+    return this.queryNode(node.left, start, end) + this.queryNode(node.right, start, end)
+  }
+}
+
+const CountIntervals = function () {
+  this.tree = new SegmentTree(0, 1e9)
+}
+
+/**
+ * @param {number} left
+ * @param {number} right
+ * @return {void}
+ */
+CountIntervals.prototype.add = function (left, right) {
+  this.tree.update(left, right)
+}
+
+/**
+ * @return {number}
+ */
+CountIntervals.prototype.count = function () {
+  return this.tree.query(0, 1e9)
+}
+
+// 作者：scnu_evan
+// 链接：https://leetcode.cn/circle/discuss/h00hT2/
+// 来源：力扣（LeetCode）
+// 著作权归作者所有。商业转载请联系作者获得授权，非商业转载请注明出处。