0438-find-all-anagrams-in-a-string.adoc

438. Find All Anagrams in a String

{leetcode}/problems/find-all-anagrams-in-a-string/[LeetCode - Find All Anagrams in a String^]

Given a string s and a non-empty string p, find all the start indices of p's anagrams in s.

Strings consists of lowercase English letters only and the length of both strings s and p will not be larger than 20,100.

The order of output does not matter.

Example 1:

Input:
s: "cbaebabacd" p: "abc"

Output:
[0, 6]

Explanation:
The substring with start index = 0 is "cba", which is an anagram of "abc".
The substring with start index = 6 is "bac", which is an anagram of "abc".

Example 2:

Input:
s: "abab" p: "ab"

Output:
[0, 1, 2]

Explanation:
The substring with start index = 0 is "ab", which is an anagram of "ab".
The substring with start index = 1 is "ba", which is an anagram of "ab".
The substring with start index = 2 is "ab", which is an anagram of "ab".

解题分析

使用滑动窗口来"圈定"字符串！

一刷

link:{sourcedir}/_0438_FindAllAnagramsInAString.java[role=include]

二刷

link:{sourcedir}/_0438_FindAllAnagramsInAString_2.java[role=include]

思考题

尝试使用数组来代替 Map。

参考资料

1. 438. 找到字符串中所有字母异位词 - 官方题解

2. 滑动窗口通用思想解决子串问题 - 找到字符串中所有字母异位词

3. Java优化labuladong大佬滑动窗口通用方法 - 找到字符串中所有字母异位词