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 part2

Browse Source
This commit is contained in:
小墨
2022-03-27 20:38:29 +08:00
parent 5a4fa6db12
commit 0fc7f4b734
1617 changed files with 134637 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

28
算法题（国内版）/problem (Chinese)/字符串轮转 [string-rotation-lcci].html Normal file
View File

@@ -0,0 +1,28 @@
<p>字符串轮转。给定两个字符串<code>s1</code>和<code>s2</code>，请编写代码检查<code>s2</code>是否为<code>s1</code>旋转而成（比如，<code>waterbottle</code>是<code>erbottlewat</code>旋转后的字符串）。</p>
<p><strong>示例1:</strong></p>
<pre><strong> 输入</strong>：s1 = &quot;waterbottle&quot;, s2 = &quot;erbottlewat&quot;
<strong> 输出</strong>：True
</pre>
<p><strong>示例2:</strong></p>
<pre><strong> 输入</strong>：s1 = &quot;aa&quot;, s2 = &quot;aba&quot;
<strong> 输出</strong>：False
</pre>
<ol>
</ol>
<p><strong>提示：</strong></p>
<ol>
<li>字符串长度在[0, 100000]范围内。</li>
</ol>
<p><strong>说明:</strong></p>
<ol>
<li>你能只调用一次检查子串的方法吗？</li>
</ol>