Given two strings s1 and s2, write a function to return true if s2 contains the permutation of s1. In other words, one of the first string’s permutations is the substring of the second string.
s1 = “ab”
s2 = “eidbaooo”
Explanation: s2 contains one permutation of s1 (“ba”).
s2 = “eidboaoo”
- The input strings only contain lower case letters.
- The length of both given strings is in the range [1, 10,000].
After reading the request, you will find out this problem is almost the same as problem 438. The word permutation is the same as the word anagrams. So it is easy, we can just use function findAnagrams from problem 438 to solve this problem.
Code download address: https://github.com/tinyfool/leetcode/tree/master/src/p0567
Want to know details of the sliding window algorithm, check my post: The Sliding Window Algorithm for string and array.