30 lines
931 B
Markdown
30 lines
931 B
Markdown
|
<p>给定两个字符串 <code>s1</code> 和 <code>s2</code>，写一个函数来判断 <code>s2</code> 是否包含 <code>s1</code><strong> </strong>的排列。</p>
|
|||
|
|
|
|||
|
|
<p>换句话说，第一个字符串的排列之一是第二个字符串的 <strong>子串</strong> 。</p>
|
|||
|
|
|
|||
|
|
<p> </p>
|
|||
|
|
|
|||
|
|
<p><strong>示例 1：</strong></p>
|
|||
|
|
|
|||
|
|
<pre>
|
|||
|
|
<strong>输入: </strong>s1 = "ab" s2 = "eidbaooo"
|
|||
|
|
<strong>输出: </strong>True
|
|||
|
|
<strong>解释:</strong> s2 包含 s1 的排列之一 ("ba").
|
|||
|
|
</pre>
|
|||
|
|
|
|||
|
|
<p><strong>示例 2：</strong></p>
|
|||
|
|
|
|||
|
|
<pre>
|
|||
|
|
<strong>输入: </strong>s1= "ab" s2 = "eidboaoo"
|
|||
|
|
<strong>输出:</strong> False
|
|||
|
|
</pre>
|
|||
|
|
|
|||
|
|
<p> </p>
|
|||
|
|
|
|||
|
|
<p><strong>提示：</strong></p>
|
|||
|
|
|
|||
|
|
<ul>
|
|||
|
|
<li>输入的字符串只包含小写字母</li>
|
|||
|
|
<li>两个字符串的长度都在 <code>[1, 10,000]</code> 之间</li>
|
|||
|
|
</ul>
|
|||
|
|
<div><div>Related Topics</div><div><li>双指针</li><li>Sliding Window</li></div></div>\n<div><li>👍 357</li><li>👎 0</li></div>
|