原题地址：https://leetcode.com/problems/permutation-in-string/

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.

**Example 1:**

Input:

s1 = “ab”

s2 = “eidbaooo”Output:TrueExplanation:s2 contains one permutation of s1 (“ba”).

**Example 2:**

Input:

s1= “ab”

s2 = “eidboaoo”Output:False

**Note:**

- 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

**. So it is easy, we can just use function**

*anagrams**from problem 438 to solve this problem.*

**findAnagrams**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.