coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-13 19:31:42 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

add leetcode problem-cn part5

Browse Source
This commit is contained in:
小墨
2022-03-27 20:52:13 +08:00
parent 053330914a
commit c11d601602
326 changed files with 26353 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

42
算法题（国内版）/problem (Chinese)/环绕字符串中唯一的子字符串 [unique-substrings-in-wraparound-string].html Normal file
View File

@@ -0,0 +1,42 @@
<p>把字符串 <code>s</code> 看作是&nbsp;<code>“abcdefghijklmnopqrstuvwxyz”</code>&nbsp;的无限环绕字符串，所以&nbsp;<code>s</code> 看起来是这样的：</p>
<ul>
<li><code>"...zabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcd...."</code>&nbsp;.&nbsp;</li>
</ul>
<p>现在给定另一个字符串 <code>p</code> 。返回<em>&nbsp;<code>s</code> 中&nbsp;<strong>唯一</strong> 的 <code>p</code> 的 <strong>非空子串</strong>&nbsp;的数量&nbsp;</em>。&nbsp;</p>
<p>&nbsp;</p>
<p><strong>示例&nbsp;1:</strong></p>
<pre>
<strong>输入:</strong> p = "a"
<strong>输出:</strong> 1
<strong>解释:</strong> 字符串 s 中只有一个"a"子字符。
</pre>
<p><strong>示例 2:</strong></p>
<pre>
<strong>输入:</strong> p = "cac"
<strong>输出:</strong> 2
<strong>解释:</strong> 字符串 s 中的字符串“cac”只有两个子串“a”、“c”。.
</pre>
<p><strong>示例 3:</strong></p>
<pre>
<strong>输入:</strong> p = "zab"
<strong>输出:</strong> 6
<strong>解释:</strong> 在字符串 s 中有六个子串“z”、“a”、“b”、“za”、“ab”、“zab”。
</pre>
<p>&nbsp;</p>
<p><strong>提示:</strong></p>
<ul>
<li><code>1 &lt;= p.length &lt;= 10<sup>5</sup></code></li>
<li><code>p</code>&nbsp;由小写英文字母构成</li>
</ul>