Given two strings s1 and s2, return true if s2 contains a permutation of s1, or false otherwise.
In other words, return true if one of s1's permutations is the substring of s2.
Example 1:
Input: s1 = "ab", s2 = "eidbaooo"
Output: true
Explanation: s2 contains one permutation of s1 ("ba").
Example 2:
Input: s1 = "ab", s2 = "eidboaoo"
Output: false
Constraints:
1 <= s1.length, s2.length <= 104s1 and s2 consist of lowercase English letters.給定兩個字串 s1 , s2
定義如果字串 t 是 字串 s 的 permutation
則 t, s 的字元組成相同，也就是 s, t 中的字元種類相同且個數相同
要求寫一個演算法判斷 s2 中有沒有包含 s1 字串的 permutation
如果 s2 要包含 s1 的 permutation
代表 s2 長度一定要 ≥ s1 長度