permutation-in-string

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

cangjie

Algorithms

Given two strings <code>s1</code> and <code>s2</code>, return <code>true</code> if <code>s2</code> contains a permutation of <code>s1</code>, or <code>false</code> otherwise.

In other words, return <code>true</code> if one of <code>s1</code>&#39;s permutations is the substring of <code>s2</code>.

&nbsp;
Example 1:

<pre>
Input: s1 = &quot;ab&quot;, s2 = &quot;eidbaooo&quot;
Output: true
Explanation: s2 contains one permutation of s1 (&quot;ba&quot;).
</pre>

Example 2:

<pre>
Input: s1 = &quot;ab&quot;, s2 = &quot;eidboaoo&quot;
Output: false
</pre>

&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= s1.length, s2.length &lt;= 104</code></li>
	<li><code>s1</code> and <code>s2</code> consist of lowercase English letters.</li>
</ul>

checkInclusion

Permutation in String

Minimum Window Substring

minimum-window-substring

最小覆盖子串

Find All Anagrams in a String

find-all-anagrams-in-a-string

找到字符串中所有字母异位词

Hash Table

Two Pointers

String

Sliding Window

给你两个字符串&nbsp;<code>s1</code>&nbsp;和&nbsp;<code>s2</code> ，写一个函数来判断 <code>s2</code> 是否包含 <code>s1</code>&nbsp;的 排列。如果是，返回 <code>true</code> ；否则，返回 <code>false</code> 。

换句话说，<code>s1</code> 的排列之一是 <code>s2</code> 的 子串 。

&nbsp;

示例 1：

<pre>
输入：s1 = "ab" s2 = "eidbaooo"
输出：true
解释：s2 包含 s1 的排列之一 ("ba").
</pre>

示例 2：

<pre>
输入：s1= "ab" s2 = "eidboaoo"
输出：false
</pre>

&nbsp;

提示：

<ul>
	<li><code>1 &lt;= s1.length, s2.length &lt;= 104</code></li>
	<li><code>s1</code> 和 <code>s2</code> 仅包含小写字母</li>
</ul>