coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-11-04 03:33:12 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

add scripts and problemset

Browse Source
This commit is contained in:
小墨
2022-03-27 18:27:43 +08:00
parent e632b8e00c
commit adb80564bd
1653 changed files with 379412 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

34
算法题/maximum-number-of-occurrences-of-a-substring.html Normal file
View File

@@ -0,0 +1,34 @@
<p>Given a string <code>s</code>, return the maximum number of ocurrences of <strong>any</strong> substring under the following rules:</p>
<ul>
<li>The number of unique characters in the substring must be less than or equal to <code>maxLetters</code>.</li>
<li>The substring size must be between <code>minSize</code> and <code>maxSize</code> inclusive.</li>
</ul>
<p>&nbsp;</p>
<p><strong>Example 1:</strong></p>
<pre>
<strong>Input:</strong> s = &quot;aababcaab&quot;, maxLetters = 2, minSize = 3, maxSize = 4
<strong>Output:</strong> 2
<strong>Explanation:</strong> Substring &quot;aab&quot; has 2 ocurrences in the original string.
It satisfies the conditions, 2 unique letters and size 3 (between minSize and maxSize).
</pre>
<p><strong>Example 2:</strong></p>
<pre>
<strong>Input:</strong> s = &quot;aaaa&quot;, maxLetters = 1, minSize = 3, maxSize = 3
<strong>Output:</strong> 2
<strong>Explanation:</strong> Substring &quot;aaa&quot; occur 2 times in the string. It can overlap.
</pre>
<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>
<ul>
<li><code>1 &lt;= s.length &lt;= 10<sup>5</sup></code></li>
<li><code>1 &lt;= maxLetters &lt;= 26</code></li>
<li><code>1 &lt;= minSize &lt;= maxSize &lt;= min(26, s.length)</code></li>
<li><code>s</code> consists of only lowercase English letters.</li>
</ul>