Leetcode——438. Find All Anagrams in a Stringjava

Posted fish in the sea

tags:

篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了Leetcode——438. Find All Anagrams in a Stringjava相关的知识,希望对你有一定的参考价值。

第一反应感觉是排列组合及字符匹配问题

【既不是可重复排列,有可能不是全排列】

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".

 

以上是关于Leetcode——438. Find All Anagrams in a Stringjava的主要内容,如果未能解决你的问题,请参考以下文章

leetcode-438-Find All Anagrams in a String

LeetCode-438.Find All Anagrams in a String

LeetCode 438. Find All Anagrams in a String

[LeetCode] 438. Find All Anagrams in a String

[leetcode]438. Find All Anagrams in a String找出所有变位词

leetcode_438_Find All Anagrams in a String_哈希表_java实现