longest-substring-of-one-repeating-character

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

cangjie

Algorithms

You are given a 0-indexed string <code>s</code>. You are also given a 0-indexed string <code>queryCharacters</code> of length <code>k</code> and a 0-indexed array of integer indices <code>queryIndices</code> of length <code>k</code>, both of which are used to describe <code>k</code> queries.

The <code>ith</code> query updates the character in <code>s</code> at index <code>queryIndices[i]</code> to the character <code>queryCharacters[i]</code>.

Return an array <code>lengths</code> of length <code>k</code> where <code>lengths[i]</code> is the length of the longest substring of <code>s</code> consisting of only one repeating character after the <code>ith</code> query is performed.

&nbsp;
Example 1:

<pre>
Input: s = &quot;babacc&quot;, queryCharacters = &quot;bcb&quot;, queryIndices = [1,3,3]
Output: [3,3,4]
Explanation: 
- 1st query updates s = &quot;bbbacc&quot;. The longest substring consisting of one repeating character is &quot;bbb&quot; with length 3.
- 2nd query updates s = &quot;bbbccc&quot;. 
 The longest substring consisting of one repeating character can be &quot;bbb&quot; or &quot;ccc&quot; with length 3.
- 3rd query updates s = &quot;bbbbcc&quot;. The longest substring consisting of one repeating character is &quot;bbbb&quot; with length 4.
Thus, we return [3,3,4].
</pre>

Example 2:

<pre>
Input: s = &quot;abyzz&quot;, queryCharacters = &quot;aa&quot;, queryIndices = [2,1]
Output: [2,3]
Explanation:
- 1st query updates s = &quot;abazz&quot;. The longest substring consisting of one repeating character is &quot;zz&quot; with length 2.
- 2nd query updates s = &quot;aaazz&quot;. The longest substring consisting of one repeating character is &quot;aaa&quot; with length 3.
Thus, we return [2,3].
</pre>

&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= s.length &lt;= 105</code></li>
	<li><code>s</code> consists of lowercase English letters.</li>
	<li><code>k == queryCharacters.length == queryIndices.length</code></li>
	<li><code>1 &lt;= k &lt;= 105</code></li>
	<li><code>queryCharacters</code> consists of lowercase English letters.</li>
	<li><code>0 &lt;= queryIndices[i] &lt; s.length</code></li>
</ul>

longestRepeating

Longest Substring of One Repeating Character

Merge Intervals

merge-intervals

合并区间

Longest Repeating Character Replacement

longest-repeating-character-replacement

替换后的最长重复字符

Consecutive Characters

consecutive-characters

连续字符

Create Sorted Array through Instructions

create-sorted-array-through-instructions

通过指令创建有序数组

Longest Increasing Subsequence II

longest-increasing-subsequence-ii

最长递增子序列 II

Segment Tree

Array

String

Ordered Set

给你一个下标从 0 开始的字符串 <code>s</code> 。另给你一个下标从 0 开始、长度为 <code>k</code> 的字符串 <code>queryCharacters</code> ，一个下标从 <code>0</code> 开始、长度也是 <code>k</code> 的整数 下标 数组&nbsp;<code>queryIndices</code> ，这两个都用来描述 <code>k</code> 个查询。

第 <code>i</code> 个查询会将 <code>s</code> 中位于下标 <code>queryIndices[i]</code> 的字符更新为 <code>queryCharacters[i]</code> 。

返回一个长度为 <code>k</code> 的数组 <code>lengths</code> ，其中 <code>lengths[i]</code> 是在执行第 <code>i</code> 个查询 之后 <code>s</code> 中仅由 单个字符重复 组成的 最长子字符串 的 长度 。

&nbsp;

示例 1：

<pre>
输入：s = "babacc", queryCharacters = "bcb", queryIndices = [1,3,3]
输出：[3,3,4]
解释：
- 第 1 次查询更新后 s = "bbbacc" 。由单个字符重复组成的最长子字符串是 "bbb" ，长度为 3 。
- 第 2 次查询更新后 s = "bbbccc" 。由单个字符重复组成的最长子字符串是 "bbb" 或 "ccc"，长度为 3 。
- 第 3 次查询更新后 s = "bbbbcc" 。由单个字符重复组成的最长子字符串是 "bbbb" ，长度为 4 。
因此，返回 [3,3,4] 。</pre>

示例 2：

<pre>
输入：s = "abyzz", queryCharacters = "aa", queryIndices = [2,1]
输出：[2,3]
解释：
- 第 1 次查询更新后 s = "abazz" 。由单个字符重复组成的最长子字符串是 "zz" ，长度为 2 。
- 第 2 次查询更新后 s = "aaazz" 。由单个字符重复组成的最长子字符串是 "aaa" ，长度为 3 。
因此，返回 [2,3] 。
</pre>

&nbsp;

提示：

<ul>
	<li><code>1 &lt;= s.length &lt;= 105</code></li>
	<li><code>s</code> 由小写英文字母组成</li>
	<li><code>k == queryCharacters.length == queryIndices.length</code></li>
	<li><code>1 &lt;= k &lt;= 105</code></li>
	<li><code>queryCharacters</code> 由小写英文字母组成</li>
	<li><code>0 &lt;= queryIndices[i] &lt; s.length</code></li>
</ul>