cbvirtua 1.0.82 → 1.0.83

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "cbvirtua",
-  "version": "1.0.82",
+  "version": "1.0.83",
   "description": "",
   "main": "index.js",
   "scripts": {

package//346/226/260/345/273/272 /346/226/207/346/234/254/346/226/207/346/241/243 (5).txt"

@@ -0,0 +1,49 @@
+ function longestRepeating(s: string, queryCharacters: string, queryIndices: number[]): number[] {
+    const n = s.length
+    const q = queryIndices.length
+    const res = Array(q).fill(1)
+
+    const odt = new ODT(n, -1) // !珂朵莉树维护区间字符类型
+    s.split('').forEach((c, i) => {
+      odt.set(i, i + 1, c.charCodeAt(0) - 97)
+    })
+
+    const lens = new SortedList<number>() // !SortedList维护每个连续段的长度
+    odt.enumerateAll((start, end, value) => {
+      if (value !== -1) {
+        lens.add(end - start)
+      }
+    })
+
+    for (let i = 0; i < q; i++) {
+      const target = queryCharacters.charCodeAt(i) - 97
+      const pos = queryIndices[i]
+
+      // !每次更新最多影响左中右三段区间
+      // !先删除这三段区间的长度，修改后，再添加这三段区间的长度
+      // 这种做法无需分类讨论
+      const [start, end] = odt.get(pos)!
+      const leftSeg = odt.get(start - 1)
+      const rightSeg = odt.get(end)
+      const first = leftSeg ? leftSeg[0] : 0
+      const last = rightSeg ? rightSeg[1] : n
+      odt.enumerateRange(first, last, (start, end) => {
+        lens.discard(end - start)
+      })
+
+      odt.set(pos, pos + 1, target)
+
+      odt.enumerateRange(first, last, (start, end) => {
+        lens.add(end - start)
+      })
+
+      res[i] = lens.max()
+    }
+
+    return res
+  }
+
+作者：草莓奶昔🍓
+链接：https://leetcode.cn/problems/longest-substring-of-one-repeating-character/solutions/2287639/typescript-ke-duo-li-shu-by-981377660lmt-n77n/
+来源：力扣（LeetCode）
+著作权归作者所有。商业转载请联系作者获得授权，非商业转载请注明出处。