https://leetcode.com/problems/permutation-in-string/description/
class Solution {
public:
bool checkInclusion(string s1, string s2) {
int n1 = s1.size(), n2 = s2.size();
vector<int>m1(128), m2(128);
for(int i=0; i<n1; i++){
++m1[s1[i]]; ++m2[s2[i]];
}
if(m1==m2) return true;
for(int i=n1; i<n2; i++){ //sliding window
++m2[s2[i]]; //窗口向右滑动加一个
--m2[s2[i-n1]]; //窗口滑动左边减一个
if(m1==m2) return true;
}
return false;
}
};