mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-01-11 02:58:13 +08:00
39 lines
2.3 KiB
HTML
39 lines
2.3 KiB
HTML
|
<p>You are given a string <code>s</code> and array <code>queries</code> where <code>queries[i] = [left<sub>i</sub>, right<sub>i</sub>, k<sub>i</sub>]</code>. We may rearrange the substring <code>s[left<sub>i</sub>...right<sub>i</sub>]</code> for each query and then choose up to <code>k<sub>i</sub></code> of them to replace with any lowercase English letter.</p>
|
||
|
|
|
||
|
|
<p>If the substring is possible to be a palindrome string after the operations above, the result of the query is <code>true</code>. Otherwise, the result is <code>false</code>.</p>
|
||
|
|
|
||
|
|
<p>Return a boolean array <code>answer</code> where <code>answer[i]</code> is the result of the <code>i<sup>th</sup></code> query <code>queries[i]</code>.</p>
|
||
|
|
|
||
|
|
<p>Note that each letter is counted individually for replacement, so if, for example <code>s[left<sub>i</sub>...right<sub>i</sub>] = "aaa"</code>, and <code>k<sub>i</sub> = 2</code>, we can only replace two of the letters. Also, note that no query modifies the initial string <code>s</code>.</p>
|
||
|
|
|
||
|
|
<p> </p>
|
||
|
|
<p><strong>Example :</strong></p>
|
||
|
|
|
||
|
|
<pre>
|
||
|
|
<strong>Input:</strong> s = "abcda", queries = [[3,3,0],[1,2,0],[0,3,1],[0,3,2],[0,4,1]]
|
||
|
|
<strong>Output:</strong> [true,false,false,true,true]
|
||
|
|
<strong>Explanation:</strong>
|
||
|
|
queries[0]: substring = "d", is palidrome.
|
||
|
|
queries[1]: substring = "bc", is not palidrome.
|
||
|
|
queries[2]: substring = "abcd", is not palidrome after replacing only 1 character.
|
||
|
|
queries[3]: substring = "abcd", could be changed to "abba" which is palidrome. Also this can be changed to "baab" first rearrange it "bacd" then replace "cd" with "ab".
|
||
|
|
queries[4]: substring = "abcda", could be changed to "abcba" which is palidrome.
|
||
|
|
</pre>
|
||
|
|
|
||
|
|
<p><strong>Example 2:</strong></p>
|
||
|
|
|
||
|
|
<pre>
|
||
|
|
<strong>Input:</strong> s = "lyb", queries = [[0,1,0],[2,2,1]]
|
||
|
|
<strong>Output:</strong> [false,true]
|
||
|
|
</pre>
|
||
|
|
|
||
|
|
<p> </p>
|
||
|
|
<p><strong>Constraints:</strong></p>
|
||
|
|
|
||
|
|
<ul>
|
||
|
|
<li><code>1 <= s.length, queries.length <= 10<sup>5</sup></code></li>
|
||
|
|
<li><code>0 <= left<sub>i</sub> <= right<sub>i</sub> < s.length</code></li>
|
||
|
|
<li><code>0 <= k<sub>i</sub> <= s.length</code></li>
|
||
|
|
<li><code>s</code> consists of lowercase English letters.</li>
|
||
|
|
</ul>
|